Every planar graph with cycles of length neither 4 nor 5 is (1,1,0)-colorable

DOI10.1007/S10878-012-9586-4zbMATH Open1309.05058OpenAlexW2011909118MaRDI QIDQ489724FDOQ489724

Authors: Lingji Xu, Zhengke Miao, Yingqian Wang 

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9586-4

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

zbMATH Keywords

planar graphimproper coloringSteinberg's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Title not available (Why is that?)
• List Improper Colourings of Planar Graphs
• Title not available (Why is that?)
• 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
• A relaxation of Novosibirsk 3-color conjecture
• \((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 cycles of length from 4 to 6 are \((1,0,0)\)-colorable
• On \((3,1)^*\)-coloring of plane graphs
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
• 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)