Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker

Daniel W. Cranston, Landon Rabern. Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb., 44:23-42, 2015. [doi]

Abstract

Abstract is missing.