Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
From MaRDI portal
Publication:2444905
DOI10.1016/j.ipl.2013.06.001zbMath1285.05071MaRDI QIDQ2444905
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.001
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles, 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 prescribed short cycles, Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable, \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\), Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-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
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- A Grötzsch-Type Theorem for List Colourings with Impropriety One
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- On $(3,1)^*$-Coloring of Plane Graphs
- A note on list improper coloring planar graphs
