A relaxation of the Bordeaux conjecture

DOI10.1016/j.ejc.2015.04.001zbMath1315.05059arXiv1407.5138OpenAlexW1484426034WikidataQ122998908 ScholiaQ122998908MaRDI QIDQ2349972

Gexin Yu, Xiangwen Li, Runrun Liu

Publication date: 18 June 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

(2, 0, 0)-colorability

Mathematics Subject Classification ID

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

Related Items (8)

Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ A relaxation of Novosibirsk 3-color conjecture

Cites Work

• Unnamed Item
• 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
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
• A sufficient condition for planar graphs to be 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Colorings of plane graphs: a survey
• A 3-color theorem on plane graphs without 5-circuits
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
• On $(3,1)^*$-Coloring of Plane Graphs
• A Relaxation of Steinberg's Conjecture
• On a conjecture of B. Grünbaum

This page was built for publication: A relaxation of the Bordeaux conjecture