Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable

DOI10.1007/s00373-023-02713-0zbMath1527.05071MaRDI QIDQ6081925

Jian-Bo Lv, Xiangwen Li, Jie Liu

Publication date: 29 November 2023

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

zbMATH Keywords

planar graphcoloringdefective coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• List improper colorings of planar graphs with prescribed girth
• 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
• Near-colorings: non-colorable graphs and NP-completeness
• A relaxation of the Bordeaux conjecture
• Defective 2-colorings of sparse graphs
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• A relaxation of the strong Bordeaux Conjecture
• On $(3,1)^*$-Coloring of Plane Graphs
• Improper coloring of graphs on surfaces
• Improper choosability of graphs and maximum average degree

This page was built for publication: Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable