An (F₂, F₆)-partition of planar graphs without cycles of length 4 and 6

DOI10.1016/J.DISC.2025.114626MaRDI QIDQ6933607zbMATH OpenFDO

Authors Ziwen Huang, Xiangwen Li, Lin Niu

Publication date 4 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(F_i\)-saturated graphforestplanar graphvertex partition

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 relaxation of Steinberg's conjecture
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• Defective 2-colorings of sparse graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
• Every planar graph with girth at least 5 is (1,9)-colorable
• 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
• scientific article; zbMATH DE number 434910 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• Improper choosability of graphs and maximum average degree
• List Improper Colourings of Planar Graphs
• On the linear vertex-arboricity of a planar graph
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-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
• Threshold for path colorings of planar graphs

Cited in

(2)

• Every planar graph without 4- and 6-cycles is (2,5)-colorable
• On \((\mathscr{F, F}_2)\)-partitionability of planar graphs without \(\{4,7\}\)-cycles

This page was built for publication: An \((\mathcal{F}_2, \mathcal{F}_6)\)-partition of planar graphs without cycles of length 4 and 6

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