Every planar graph with cycles of length neither 4 nor 5 is (1,1,0)-colorable
From MaRDI portal
(Redirected from Publication:489724)
Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
Recommendations
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Planar graphs without cycles of length from 4 to 6 are \((1,0,0)\)-colorable
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
Cites work
- scientific article; zbMATH DE number 434910 (Why is no real title available?)
- scientific article; zbMATH DE number 1250667 (Why is no real title available?)
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- On \((3,1)^*\)-coloring of plane graphs
Cited in
(28)- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
- A relaxation of Steinberg's conjecture
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
- A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
- Fractional coloring planar graphs under Steinberg-type conditions
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
- Every planar graph with girth at least 5 is (1,9)-colorable
- A relaxation of the Bordeaux conjecture
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- A relaxation of Novosibirsk 3-color conjecture
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
- Planar graphs without cycles of length from 4 to 6 are \((1,0,0)\)-colorable
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
- On \((3,1)^*\)-coloring of plane graphs
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable
- Improper colorability of planar graphs without prescribed short cycles
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
This page was built for publication: Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489724)
