4 papers
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…
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…
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
James Anderson, Herman Chau, Eun-Kyung Cho +6
We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chr…