3 papers
math.CO2025
Counting Small Cycle Double Covers
Jorik Jooken, Ben Seamone, Carol T. Zamfirescu
A theorem due to Seyffarth states that every planar -connected -vertex graph has a cycle double cover (CDC) containing at most cycles (a "small" CDC). We extend this th…
math.CO2023
Fractional eternal domination: securely distributing resources across a network
Fnu Devvrit, Aaron Krim-Yee, Nithish Kumar +4
This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows an…
math.CO2023
Defective acyclic colorings of planar graphs
On-Hei Solomon Lo, Ben Seamone, Xuding Zhu
This paper studies two variants of defective acyclic coloring of planar graphs. For a graph and a coloring of , a 2CC transversal is a subset of that interse…