3 papers
math.CO2026
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…
math.CO2025
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 res…
math.CO2025
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…