32 citations · 32 across the 10 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025
Hamiltonian Cycles in Subdivided Doubles
David Eppstein
The subdivided double construction on 4-regular graphs was used by Potočnik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used…
math.CO2025
String Graph Obstacles of High Girth and of Bounded Degree
Maria Chudnovsky, David Eppstein, David Fischer
A string graph is the intersection graph of curves in the plane. Kratochvíl previously showed the existence of infinitely many obstacles: graphs that are not string graphs but for…
math.CO2009★ 32 cited
Combinatorics and geometry of finite and infinite squaregraphs
Hans-Jurgen Bandelt, Victor Chepoi, David Eppstein
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident wit…