A relaxation of the strong Bordeaux Conjecture

DOI10.1002/jgt.22208zbMath1396.05030arXiv1508.07890OpenAlexW2964180079WikidataQ123266044 ScholiaQ123266044MaRDI QIDQ4575529

Ziwen Huang, Xiangwen Li, Gexin Yu

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

planar graphrelaxed coloringstrong Bordeaux conjecturesuperextandable

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ 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

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