Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
DOI10.1007/S10878-016-0039-3zbMATH Open1369.05038OpenAlexW2409176203MaRDI QIDQ2012890FDOQ2012890
Authors: Ying Bai, Xiangwen Li, Gexin Yu 
Publication date: 3 August 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0039-3
Recommendations
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 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 from 4 to 6 are \((1,0,0)\)-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- A note on list improper coloring planar graphs
- Title not available (Why is that?)
- A \((3,1)^\ast\)-choosable theorem on planar graphs
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- Steinberg's conjecture is false
- Title not available (Why is that?)
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- A relaxation of Steinberg's conjecture
Cited In (2)
This page was built for publication: Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012890)
