On graphs with chromatic number and maximum degree both equal to nine
Combinatorics
2024-08-26 v1
Abstract
An equivalent version of the Borodin-Kostochka Conjecture, due to Cranston and Rabern, says that any graph with contains 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 .
Cite
@article{arxiv.2408.12693,
title = {On graphs with chromatic number and maximum degree both equal to nine},
author = {Rachel Galindo and Jessica McDonald},
journal= {arXiv preprint arXiv:2408.12693},
year = {2024}
}