Coloring a graph with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" display="inline" overflow="scroll"><mml:mi>Δ</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:math> colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker

European Journal of Combinatorics - Tập 44 - Trang 23-42 - 2015
Daniel W. Cranston1, Landon Rabern2
1Department of Mathematics and Applied Mathematics, Virginia Commonwealth University, Richmond, VA 23284, United States
2School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ 85287, United States

Tài liệu tham khảo

Thông tin
Thông tin xuất bản

European Journal of Combinatorics

Tập 44

23-42

Thông tin tác giả