Partitioning a planar graph without chordal 5-cycles into two forests. (English) Zbl 07893387
Summary: It was known that the vertex set of every planar graph can be partitioned into three forests. We prove that the vertex set of a planar graph without chordal 5-cycles can be partitioned into two forests. This extends a result obtained by A. Raspaud and W. Wang [Eur. J. Comb. 29, No. 4, 1064–1075 (2008; Zbl 1144.05024)].
MSC:
| 05C15 | Coloring of graphs and hypergraphs |
Citations:
Zbl 1144.05024References:
| [1] | Borodin, O. V.; Ivanova, A. O., Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable, J. Graph Theory 62 (2009), 234-240 · Zbl 1180.05035 · doi:10.1002/jgt.20394 |
| [2] | Chartrand, G.; Kronk, H. V., The point-arboricity of planar graphs, J. Lond. Math. Soc. 44 (1969), 612-616 · Zbl 0175.50505 · doi:10.1112/jlms/s1-44.1.612 |
| [3] | Chartrand, G.; Kronk, H. V.; Wall, C. E., The point-arboricity of a graph, Isr. J. Math. 6 (1968), 169-175 · Zbl 0164.54201 · doi:10.1007/BF02760181 |
| [4] | Chen, M.; Raspaud, A.; Wang, W., Vertex-arboricity of planar graphs without intersecting triangles, Eur. J. Comb. 33 (2012), 905-923 · Zbl 1250.05062 · doi:10.1016/j.ejc.2011.09.017 |
| [5] | Garey, M. R.; Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York (1979) · Zbl 0411.68039 |
| [6] | Hakimi, S. L.; Schmeichel, E. F., A note on the vertex arboricity of a graph, SIAM J. Discrete Math. 2 (1989), 64-67 · Zbl 0684.05028 · doi:10.1137/0402007 |
| [7] | Huang, D.; Shiu, W. C.; Wang, W., On the vertex-arboricity of planar graphs without 7-cycles, Discrete Math. 312 (2012), 2304-2315 · Zbl 1245.05029 · doi:10.1016/j.disc.2012.03.035 |
| [8] | Huang, D.; Wang, W., Vertex arboricity of planar graphs without chordal 6-cycles, Int. J. Comput. Math. 90 (2013), 258-272 · Zbl 1278.05100 · doi:10.1080/00207160.2012.727989 |
| [9] | Raspaud, A.; Wang, W., On the vertex-arboricity of planar graphs, Eur. J. Comb. 29 (2008), 1064-1075 · Zbl 1144.05024 · doi:10.1016/j.ejc.2007.11.022 |
| [10] | Stein, S. K., \(B\)-sets and planar maps, Pac. J. Math. 37 (1971), 217-224 · Zbl 0194.56101 · doi:10.2140/pjm.1971.37.217 |
| [11] | Wang, Y.; Wang, Y.; Lih, K.-W., Partitioning kite-free planar graphs into two forests, J. Graph Theory 106 (2024), 30-56 · Zbl 1539.05124 · doi:10.1002/jgt.23062 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
