8 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…
A finite victory over de Bruijn-ErdÅs in interval discrepancy
Jared DeLeo, Owen Henderschedt, Chris Wells
We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until intervals have…
Shrinking the Jung radius: Maximizing partial coverage of finite point sets
András Bezdek, Owen Henderschedt
Jung's theorem says that planar sets of diameter can be covered by a closed circular disk of radius . In this paper we consider a fractional Jung-type problem…
Extending total colorings in planar graphs
Owen Henderschedt, Jessica McDonald
We initiate the study of total-coloring extensions, and focus our attention on planar graphs, asking: ``When can a total--coloring of some subgraph of a planar graph be…
Odd Ramsey numbers of multipartite graphs and hypergraphs
Nicholas Crawford, Emily Heath, Owen Henderschedt +2
Given a hypergraph and a subhypergraph of , the \emph{odd Ramsey number} is the minimum number of colors needed to edge-color so that every copy of $H…
Total coloring graphs with large minimum degree
Owen Henderschedt, Jessica McDonald, Songling Shan
We prove that for all , there exists a positive integer such that if is a graph on vertices with , the…