Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable

DOI10.1007/S10878-018-0298-2zbMath1393.05088arXiv1806.07511OpenAlexW2802381718MaRDI QIDQ721920

Gexin Yu, Runrun Liu, Jennifer Vandenbussche, Heather Hoskins

Publication date: 20 July 2018

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

Full work available at URL: https://arxiv.org/abs/1806.07511

zbMATH Keywords

planar graphsdischarging3-colorable graph

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 (1)

The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles

Cites Work

• Unnamed Item
• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
• Steinberg's conjecture is false
• 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
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 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
• Near-colorings: non-colorable graphs and NP-completeness
• A relaxation of the Bordeaux conjecture
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• A relaxation of the strong Bordeaux Conjecture
• On $(3,1)^*$-Coloring of Plane Graphs
• A Relaxation of Steinberg's Conjecture
• Improper Choosability of Planar Graphs without 4-Cycles
• On a conjecture of B. Grünbaum

This page was built for publication: Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable