Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The list version of the Borodin-Kostochka conjecture for graphs with large maximum degreeIlkyoo Choi, Henry A. Kierstead, Landon Rabern. DM, 346(11):113300, November 2023. [doi] The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical EdgeLandon Rabern. combinatorics, 14(1), 2007. [doi] List-Coloring Claw-Free Graphs with Δ-1 ColorsDaniel W. Cranston, Landon Rabern. siamdm, 31(2):726-748, 2017. [doi]
The following publications are possibly variants of this publication: