Abstract
Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of any simple graph G can be equitably partitioned into m subsets so that each subset induces a forest, where \(\Delta (G)\) is the maximum degree of G and m is an integer with \(m\ge \lceil \frac{\Delta (G)+1}{2}\rceil \). This conjecture is verified for 5-degenerate graphs in this paper.
Similar content being viewed by others
References
Chartrand G, Kronk HV (1969) The point-arboricity of planar graphs. J Lond Math Soc 44:612–616
Chen BL, Lih KW, Wu PL (1994) Equitable coloring and the maximum degree. Eur J Combin 15(5):443–447
Chen BL, Yen CH (2012) Equitable \(\Delta \)-coloring of graphs. Discret Math 312(9):1512–1517
Erdős P (1964) Problem 9. Theory of graphs and its applications. Czech Acad. Sci. Publ, Prague, p 159
Esperet L, Lemoine L, Maffray F (2015) Equitable partition of graphs into induced forests. Discret Math 338(8):1481–1483
Hajnal A, Szemerédi (1970) Proof of a conjecture of P. Erdős. In: Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969), North-Holland, Amsterdam, pp 601–623, 1970
Kierstead HA, Kostochka AV (2008) A short proof of the Hajnal-Szemerédi theorem on equitable colouring. Comb Probab Comput 17(2):265–270
Kierstead HA, Kostochka AV (2012) Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring. J Graph Theory 71(1):31–48
Kronk HV, Mitchem J (1975) Critical point-arboritic graphs. J Lond Math Soc. (2), 9:459–466, 1974/75
Lih KW, Wu PL (1996) On equitable coloring of bipartite graphs. Discret Math. 151(1–3):155–160. Graph theory and combinatorics (Manila, 1991)
Meyer W (1973) Equitable coloring. Am Math Mon 80:920–922
Nakprasit K (2012) Equitable colorings of planar graphs with maximum degree at least nine. Discret Math 312(5):1019–1024
Wu JL, Zhang X, Li HL (2013) Equitable vertex arboricity of graphs. Discret Math 313(23):2696–2701
Yap HP, Zhang Y (1997) The equitable \(\Delta \)-colouring conjecture holds for outerplanar graphs. Bull Inst Math Acad Sin 25(2):143–149
Zhang X (2015) Equitable vertex arboricity of planar graphs. Taiwan J Math 19(1):123–131
Zhang X, Wu JL (2011) On equitable and equitable list colorings of series-parallel graphs. Discret Math 311(10–11):800–803
Zhang X, Wu JL (2014) A conjecture on equitable vertex arboricity of graphs. FILOMAT 28:217–219
Zhang Y, Yap HP (1998) Equitable colorings of planar graphs. J Comb Math Comb Comput 27:97–105
Acknowledgments
This work was in part supported by National Science Foundation of China (11271006, 11471193), National Youth Foundation of China (11401386, 11501316), Shandong Provincial Natural Science Foundation of China (ZR2014AQ001), Independent Innovation Foundation of Shandong University (IFYT 14013) and China Scholarship Council (No. 201406220192).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, G., Gao, Y., Shan, S. et al. Equitable vertex arboricity of 5-degenerate graphs. J Comb Optim 34, 426–432 (2017). https://doi.org/10.1007/s10878-016-9997-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-016-9997-8