Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
From MaRDI portal
Publication:2359954
DOI10.1016/j.disc.2017.04.006zbMath1365.05087OpenAlexW2614448221MaRDI QIDQ2359954
Lifeng Dai, Jinghan Xu, Ying Qian Wang
Publication date: 23 June 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.04.006
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles ⋮ A relaxation of Novosibirsk 3-color conjecture
Cites Work
- Unnamed Item
- Steinberg's conjecture is false
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-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
- A note on list improper coloring of plane graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Improper colorability of planar graphs without prescribed short cycles
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable
- On $(3,1)^*$-Coloring of Plane Graphs
- A Relaxation of Steinberg's Conjecture
- Improper Choosability of Planar Graphs without 4-Cycles
- A note on list improper coloring planar graphs
This page was built for publication: Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
