24 citations · 49 across the 23 of their papers we have counts for
26 papers
List coloring -free planar graphs with a sparse matching of restricted lists
Stephen G. Hartke, Yupei Li, Joseph Pappe +3
A graph is -choosable if it has a proper coloring for every -list assignment. While every -free planar graph is -choosable, some of them are not -choosable, as…
Small -kernels in digraphs with minimum in-degree
Geoffrey Boyer, Matt Burnham, Daniela Černá +5
For a digraph , a subset is called a -kernel if is an independent set and all vertices in are reachable from via a directed path of length at…
Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity
Steffen Borgwardt, MacKenzie Carr, Ce Chen +4
Fomin, Kratochvíl, Lokshtanov, Mancini, and Telle showed that every -free graph is reconstructible from the \emph{multiset} of closed neighborhoods. We strengthen their resu…
Trail Trap: a variant of Partizan Edge Geography
Calum Buchanan, MacKenzie Carr, Alexander Clifton +4
We study a two-player game played on undirected graphs called {\sc Trail Trap}, which is a variant of a game known as {\sc Partizan Edge Geography}. One player starts by choosing a…
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…
Domination of subcubic planar graphs with large girth
Eun-Kyung Cho, Eric Culver, Stephen G. Hartke +1
Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order is at most , the domination number of cubic graphs has be…