Abstract
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two color classes differ by at most one. An equitable (q,r)-tree-coloring of a graph G is an equitable q-coloring of G such that the subgraph induced by each color class is a forest of maximum degree at most r. Let the strong equitable vertex r-arboricity of a graph G, denoted by var≡(G), be the minimum p such that G has an equitable (q,r)-tree-coloring for every q≥p. The values of va1≡(Kn,n) were investigated by Tao and Lin and Wu, Zhang, and Li where exact values of va1≡(Kn,n) were found in some special cases. In this paper, we extend their results by giving the exact values of va1≡(Kn,n) for all cases. In the process, we introduce a new function related to an equitable coloring and obtain a more general result by determining the exact value of each va1≡(Km,n) and va1≡(G) where G is a balanced complete k-partite graph Kn,…,n. Both complete bipartite graphs Km,n and balanced complete k-partite graphs Kn,…,n are symmetry in several aspects and also studied broadly. For the other aspect of symmetry, by the definition of equitable k-coloring of graphs, in a specific case that the number of colors divides the number of vertices of graph, we can say that the graph is a balanced k-partite graph.
Highlights
Throughout this paper, all graphs considered are finite and simple
Let Kk∗n denote a complete k-partite graph with each partite set has size n, and naturally we always assume that k ≥ 2
Introduced an equitable (q, r)-tree-coloring of a graph G which is a q-coloring of vertices of G
Summary
Throughout this paper, all graphs considered are finite and simple. Let V(G) and E(G) denote the vertex set and edge set of a graph G respectively. Introduced an equitable (q, r)-tree-coloring of a graph G which is a q-coloring of vertices of G such that the subgraph induced by each color class is a forest of maximum degree at most r and the sizes of any two color classes differ by at most one. Let the strong equitable vertex k-arboricity, denoted by var≡(G), be the minimum p such that G has an equitable (q, Tao and Lin r)-tree-coloring for every [11] and Wu, Zhang, and q ≥ p. We introduce a new function related to an equitable coloring and obtain a general result by determining the exact value of each va1≡(Km,n) and va1≡(G) where G is a balanced complete k-partite graph Kn,...,n
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call