\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9

DOI10.1016/j.disc.2014.03.001zbMath1288.05105OpenAlexW4300549454MaRDI QIDQ2449153

Yaochou Yang, Ying Qian Wang

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.001

zbMATH Keywords

cycleplanar graphSteinberg conjectureimproper coloring

Mathematics Subject Classification ID

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

Related Items (4)

Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• On $(3,1)^*$-Coloring of Plane Graphs
• A Relaxation of Steinberg's Conjecture
• A note on list improper coloring planar graphs

This page was built for publication: \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9