A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable

DOI10.1016/j.dam.2022.04.020zbMath1491.05065OpenAlexW4281676322WikidataQ113877213 ScholiaQ113877213MaRDI QIDQ2146740

Runrun Liu, Wei Fan Wang

Publication date: 21 June 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.04.020

zbMATH Keywords

triangle\((\mathcal{F},\mathcal{F}_2)\)-partitionchoral 6-cycle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Planar graphs without short even cycles are near-bipartite
• Decomposing a planar graph of girth 5 into an independent set and a forest
• On acyclic colorings of planar graphs
• Decomposing a planar graph into an independent set and a 3-degenerate graph
• Decomposing a planar graph into degenerate graphs
• On the vertex-arboricity of planar graphs
• On the linear vertex-arboricity of a planar graph
• Every planar map is four colorable
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

This page was built for publication: A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable