Decomposition of triangle-free planar graphs

DOI10.1016/J.EJC.2025.104227MaRDI QIDQ6930145zbMATH OpenFDO

Authors Rongxing Xu, Xuding Zhu

Publication date 16 September 2025

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

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104227

zbMATH Keywords

choosabilityplanar graph

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

• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• A not 3-choosable planar graph without 3-cycles
• Decomposing a planar graph into an independent set and a 3-degenerate graph
• Decomposing a planar graph into degenerate graphs
• Decomposing a planar graph of girth 5 into an independent set and a forest
• Decomposing a triangle-free planar graph into a forest and a subcubic forest
• Decomposing planar graphs into graphs with degree restrictions
• Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• Sub-exponentially many 3-colorings of triangle-free planar graphs
• Three-coloring triangle-free planar graphs in linear time
• Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings

This page was built for publication: Decomposition of triangle-free planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930145)