On the equitable vertex arboricity of complete tripartite graphs
2015 ◽
Vol 07
(04)
◽
pp. 1550056
The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu et al. introduced the concept of equitable [Formula: see text]-tree-coloring, which can be viewed as a generalization of proper equitable [Formula: see text]-coloring. The strong equitable vertex [Formula: see text]-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the strong equitable vertex [Formula: see text]-arboricity of complete equipartition tripartite graphs. For most cases, the exact values of [Formula: see text] are obtained.
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
2014 ◽
Vol 164
◽
pp. 34-46
◽
2011 ◽
Vol 37
◽
pp. 159-164
◽
2016 ◽
Vol 26
(3)
◽
pp. 281-295
◽
2015 ◽
Vol 115
(12)
◽
pp. 977-982
◽
2015 ◽
Vol 57
◽
pp. 41-50
◽
2014 ◽
Vol 164
◽
pp. 413-426
◽
2013 ◽
Vol 44
◽
pp. 281-286
◽