On (F, F₂)-partitionability of planar graphs without \4,7\-cycles

DOI10.1016/J.DISC.2026.115277MaRDI QIDQ7326017zbMATH OpenFDO

Authors Gaozhen Wang, Ziwen Huang, Fan Yang

Publication date 8 September 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115277

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

• An \((\mathcal{F}_2, \mathcal{F}_6)\)-partition of planar graphs without cycles of length 4 and 6
• An \((\mathcal{F}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
• Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
• Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable
• Steinberg's conjecture is false
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles

This page was built for publication: On \((\mathscr{F, F}_2)\)-partitionability of planar graphs without \(\{4,7\}\)-cycles

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