Owen Henderschedt

collaborators

4 papers

math.CO2025

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- $k$ -coloring of some subgraph $H$ of a planar graph $G$ be…

math.CO2025

Odd Ramsey numbers of multipartite graphs and hypergraphs

Nicholas Crawford, Emily Heath, Owen Henderschedt +2

Given a hypergraph $G$ and a subhypergraph $H$ of $G$ , the \emph{odd Ramsey number} $r_{o dd} (G, H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H…

math.CO2025

Total coloring graphs with large minimum degree

Owen Henderschedt, Jessica McDonald, Songling Shan

We prove that for all $ε > 0$ , there exists a positive integer $n_{0}$ such that if $G$ is a graph on $n \geq n_{0}$ vertices with $δ (G) \geq \frac{1}{2} (1 + ε) n$ , then…

math.CO2025

Graphs generated from minimal sets of finite point-set topologies

Ketai Chen, Jared DeLeo, Owen Henderschedt

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set co…