Every planar graph with girth at least 5 is (1,9)-colorable
From MaRDI portal
Publication:2124609
DOI10.1016/J.DISC.2022.112818zbMATH Open1486.05096OpenAlexW4210708603MaRDI QIDQ2124609FDOQ2124609
Jianbo Lv, Xiangwen Li, Jie Liu
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- List improper colorings of planar graphs with prescribed girth
- Title not available (Why is that?)
- List Improper Colourings of Planar Graphs
- Improper choosability of graphs and maximum average degree
- Defective 2-colorings of sparse graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Near-colorings: non-colorable graphs and NP-completeness
- 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
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
Cited In (7)
- 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 are \(9/2\)-colorable
- Title not available (Why is that?)
- 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)
