Lift-contractions

Petr A. Golovach (1) , Daniël Paulusma (2) , Marcin Kamiski (3) , Dimitrios M. Thilikos (4, 5)

1 Durham University
2 Department of Computer Science
3 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
4 ALGCO - Algorithmes, Graphes et Combinatoire
5 Department of Mathematics [Athens]

We introduce and study a partial order on graphs – lift-contractions. A graph H is a lift-contraction of a graph G if H can be obtained from G by a sequence of edge lifts and edge contractions. We give sufficient conditions for a connected graph to contain every n-vertex graph as a lift-contraction and describe the struc-ture of graphs with an excluded lift-contraction.

Mots clés: edge contractions; edge lifts; immersions; treewidth

Domaines: Mathématique discrète [cs.DM]

Petr A. Golovach, Daniël Paulusma, Marcin Kamiski, Dimitrios M. Thilikos. Lift-contractions. European Journal of Combinatorics, 2014, 35, pp.286-296. ⟨10.1016/j.ejc.2013.06.026⟩. ⟨hal-01083984⟩