On graphs with chromatic number and maximum degree both equal to nine https://arxiv.org/abs/2408.12693 #mathCO
An equivalent version of the Borodin-Kostochka Conjecture, due to Cranston and Rabern, says that any graph with $χ= Δ= 9$ contains $K_3 \lor E_6$ as a subgraph. Here we prove several results in support of this conjecture, where vertex-criticality and forbidden substructure conditions get us either close or all the way to containing $K_3 \lor E_6$.
QOTO: Question Others to Teach Ourselves An inclusive, Academic Freedom, instance All cultures welcome. Hate speech and harassment strictly forbidden.
