Every planar graph with girth at least 5 is (1,9)-colorable

DOI10.1016/J.DISC.2022.112818MaRDI QIDQ2124609zbMATH OpenOpenAlexFDO

Authors Xiangwen Li, Jie Liu, Jianbo Lv

Publication date 11 April 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2022.112818

zbMATH Keywords

planar graphcoloringdischarging methodimproper coloring

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• \((k,1)\)-coloring of sparse graphs

Cites work

• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• 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
• Improper choosability of graphs and maximum average degree
• List Improper Colourings of Planar Graphs
• List improper colorings of planar graphs with prescribed girth
• Near-colorings: non-colorable graphs and NP-completeness
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)

Cited in

(10)

• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
• A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Planar graphs are \(9/2\)-colorable
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• Fractional coloring of planar graphs of girth five
• scientific article; zbMATH DE number 6746684 (Why is no real title available?)
• Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph

This page was built for publication: Every planar graph with girth at least 5 is \((1,9)\)-colorable

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