The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree

DOI10.1016/j.disc.2022.113300zbMath1527.05061OpenAlexW4318618745WikidataQ123238357 ScholiaQ123238357MaRDI QIDQ6091818

Landon Rabern, Henry A. Kierstead, Ilkyoo Choi

Publication date: 27 November 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113300

zbMATH Keywords

list coloringbounded maximum degreeBorodin-Kostochka conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• A strengthening of Brooks' theorem
• On the choosability of complete multipartite graphs with part size three
• Weighted sums of certain dependent random variables
• Graphs with $\chi=\Delta$ Have Big Cliques
• On Representatives of Subsets
• Graph colouring and the probabilistic method

This page was built for publication: The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree