5 papers
On the recolorability of -free graphs
Henry EcheverrÃa, Owen Henderschedt
Given a graph and an integer , the reconfiguration graph of the -colorings of has as its vertices as the proper -colorings of , with an edge betw…
Odd Hadwiger number and graph products
Henry EcheverrÃa, Andrea Jiménez, Suchismita Mishra +2
The Odd Hadwiger number of a graph is the largest integer such that has a clique of size as an odd minor. In this paper, we investigate how large is the Odd Hadwige…
Coloring graphs with independence number two and no odd clique immersions
Henry EcheverrÃa, Jessica McDonald
We study the chromatic number of graphs that exclude a clique as a strong odd immersion and have independence number two. Given a graph and , we prove that if…
Totally odd immersions of complete graphs in graph products
Henry EcheverrÃa, Andrea Jiménez, Suchismita Mishra +2
For a graph , let denote the maximum integer such that contains as an immersion. A recent paper of Collins, Heenehan, and McDonald (2023) studied the behav…
Totally odd subdivisions in Kneser graphs
Henry EcheverrÃa, Andrea Jiménez, Suchismita Mishra +3
As evidence for the Odd Hadwiger Conjecture, Simonyi and Zsbán (2010) showed that every Kneser graph with large enough order (compared to ) contains a totally odd subdi…