We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:


Golovach, P.A. and Paulusma, D. and Kaminski, M. and Thilikos, D.M. (2014) 'Lift-contractions.', European journal of combinatorics., 35 . pp. 286-296.


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.

Item Type:Article
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Publisher statement:This is an open access article under the CC BY license ( by/3.0/).
Date accepted:No date available
Date deposited:08 January 2015
Date of first online publication:January 2014
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar