Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker

From MaRDI portal
Publication:472396

DOI10.1016/j.ejc.2014.09.006zbMath1303.05032arXiv1203.5380OpenAlexW2052286712WikidataQ123239294 ScholiaQ123239294MaRDI QIDQ472396

Daniel W. Cranston, Landon Rabern

Publication date: 19 November 2014

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

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




Related Items



Cites Work