Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest

DOI10.1007/s00373-022-02605-9zbMath1506.05173OpenAlexW4313482007MaRDI QIDQ2112310

Ziwen Huang, Xiaojie Huang, Jian-Bo Lv

Publication date: 10 January 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02605-9

zbMATH Keywords

partitionplanar graphforest\(F_2\)-saturated

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) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Some simplified NP-complete graph problems
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• 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
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Defective 2-colorings of sparse graphs
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• On the linear vertex-arboricity of a planar graph
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

This page was built for publication: Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest