Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
From MaRDI portal
(Redirected from Publication:2012890)
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
Cites work
- scientific article; zbMATH DE number 434910 (Why is no real title available?)
- scientific article; zbMATH DE number 54790 (Why is no real title available?)
- A \((3,1)^\ast\)-choosable theorem on planar graphs
- A note on list improper coloring planar graphs
- A note on the three color problem
- A relaxation of Steinberg's conjecture
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Steinberg's conjecture is false
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
Cited in
(4)- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
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)
