Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable

DOI10.1016/j.disc.2014.03.009zbMath1288.05094OpenAlexW2915227988MaRDI QIDQ2449160

Huihui Li, Jinghan Xu, 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.009

zbMATH Keywords

cycleplanar graphimproper coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (4)

A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-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 \((2, 0, 0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles

Cites Work

• Unnamed Item
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• A note on list improper coloring of plane graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Improper colorability of planar graphs with cycles of length neither 4 nor 6
• On $(3,1)^*$-Coloring of Plane Graphs
• A note on list improper coloring planar graphs

This page was built for publication: Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable