14 citations · 49 across the 47 of their papers we have counts for
4 papers · 1 filter
A Polynomial Kernel for Paw-Free Editing
Eduard Eiben, William Lochet, Saket Saurabh
For a fixed graph , the -free-editing problem asks whether we can modify a given graph by adding or deleting at most edges such that the resulting graph does not cont…
Symmetry properties of generalized graph truncations
Eduard Eiben, Robert Jajcay, Primož Šparl
In the generalized truncation construction, one replaces each vertex of a -regular graph with a copy of a graph of order . We investigate the symmetry properties of t…
Equimatchable factor-critical graphs and independence number 2
Eduard Eiben, Michal Kotrbcik
A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, a…
2-connected equimatchable graphs on surfaces
Eduard Eiben, Michal Kotrbčík
A graph is equimatchable if any matching in is a subset of a maximum-size matching. It is known that any -connected equimatchable graph is either bipartite or factor-cri…