Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
From MaRDI portal
Publication:393460
DOI10.1016/j.disc.2013.06.009zbMath1281.05055OpenAlexW4206606713MaRDI QIDQ393460
Owen Hill, Gexin Yu, Diana Smith, Lingji Xu, Ying Qian Wang
Publication date: 23 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.06.009
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (23)
A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable ⋮ Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable ⋮ New restrictions on defective coloring with applications to Steinberg-type graphs ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-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 ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ A relaxation of Novosibirsk 3-color conjecture ⋮ A relaxation of the Bordeaux conjecture ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Colorings of plane graphs: a survey
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- On $(3,1)^*$-Coloring of Plane Graphs
This page was built for publication: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
