Petr A. Golovach, Daniël Paulusma, Marcin Kamiński, Dimitrios M. Thilikos

Research output: Contribution to journalArticlepeer-review


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 structure of graphs with an excluded lift-contraction.

Original languageEnglish (US)
Pages (from-to)286-296
Number of pages11
JournalEuropean Journal of Combinatorics
StatePublished - Jan 2014

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Lift-contractions'. Together they form a unique fingerprint.

Cite this