33 citations · 39 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2018★ 6 cited
All minor-minimal apex obstructions with connectivity two
Adam S. Jobson, André E. Kézdy
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of mino…
math.CO2006★ 33 cited
On the editing distance of graphs
Maria Axenovich, André Kézdy, Ryan R. Martin
An edge-operation on a graph is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs , the editing…