38 citations · 246 across the 68 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
Contracting Bipartite Graphs to Paths and Cycles
Konrad K. Dabrowski, Daniël Paulusma
Testing if a given graph contains the -vertex path as a minor or as an induced minor is trivial for every fixed integer . However, the situation changes for t…
cs.DM2017
Clique-Width for Graph Classes Closed under Complementation
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +3
Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite)…