\((1,0,0)\)-colorability of planar graphs without prescribed short cycles

DOI10.1007/s10878-013-9653-5zbMath1331.90061OpenAlexW2053644263MaRDI QIDQ498436

Jinghan Xu, Yuehua Bu, Ying Qian Wang

Publication date: 28 September 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-013-9653-5

zbMATH Keywords

cycleplanar graphSteinberg conjectureimproper coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable

Cites Work

• Unnamed Item
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• On 3-colorable plane graphs without 5- and 7-cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
• Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• Planar graphs without 4-,5- and 8-cycles are 3-colorable
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Improper colorability of planar graphs with cycles of length neither 4 nor 6
• On $(3,1)^*$-Coloring of Plane Graphs
• A Relaxation of Steinberg's Conjecture

This page was built for publication: \((1,0,0)\)-colorability of planar graphs without prescribed short cycles