Decomposing a triangle-free planar graph into a forest and a subcubic forest

DOI10.1016/j.ejc.2023.103878arXiv2012.15100OpenAlexW3117212078MaRDI QIDQ6189685

Robert Šámal, Carl Feghali

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.15100

zbMATH Keywords

induced subgraphslist color method

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
• Decomposing a planar graph of girth 5 into an independent set and a forest
• On acyclic colorings of planar graphs
• Every planar graph is 5-choosable
• Decomposing a planar graph into an independent set and a 3-degenerate graph
• Decomposing a planar graph into degenerate graphs
• Near-colorings: non-colorable graphs and NP-completeness
• Sparse Graphs Are Near-Bipartite
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

This page was built for publication: Decomposing a triangle-free planar graph into a forest and a subcubic forest