An (F₃, F₄)-partition of planar graphs without 4- and 6-cycles

DOI10.1016/J.DAM.2025.04.018MaRDI QIDQ6965795zbMATH OpenFDO

Authors Kaiyang Hu, Mingfang Huang

Publication date 30 June 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.04.018

zbMATH Keywords

defective coloringplanar graphvertex partition

Mathematics Subject Classification ID

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

Cites work

• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
• 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
• Every planar graph with girth at least 5 is (1,9)-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 3565019 (Why is no real title available?)
• On the linear vertex-arboricity of a planar graph
• 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
• Steinberg's conjecture is false
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles

Cited in

(3)

• \((\mathcal{F}_1, \mathcal{F})\)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• 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}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles

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