Partitioning planar graphs into bounded degree forests

Yang Wang, Jiali Wang, Weifan Wang and Jiangxu Kong

Applied Mathematics and Computation, 2024, vol. 474, issue C

Abstract: An (Fd1,Fd2)-partition of a graph G is a partition of V(G) into two subsets V1 and V2 such that G[Vi] is a forest with maximum degree at most di for i=1,2. In this paper we show that every planar graph without 4-cycles and 6-cycles has an (F5,F5)-partition. This improves a result by Huang, Huang and Lv in 2023, which says that G has an (F2,F)-partition.

Keywords: Planar graph; Forest; Cycle; Vertex partition (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001772
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001772

DOI: 10.1016/j.amc.2024.128705

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().