On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs
Keyword(s):
An equitable partition of a graph G is a partition of the vertex set of G such that the sizes of any two parts differ by at most one. The strong equitable vertexk-arboricity of G, denoted by vak≡(G), is the smallest integer t such that G can be equitably partitioned into t′ induced forests for every t′≥t, where the maximum degree of each induced forest is at most k. In this paper, we provide a general upper bound for va2≡(Kn,n). Exact values are obtained in some special cases.
Keyword(s):
1999 ◽
Vol 8
(6)
◽
pp. 547-553
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):