2 papers
math.CO2025
Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
Rachel Galindo, Jessica McDonald, Songling Shan
We give a uniform and self-contained proof that if is a connected graph with and , then contains either or an odd hole where…
math.CO2024
On graphs with chromatic number and maximum degree both equal to nine
Rachel Galindo, Jessica McDonald
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 sever…