Title of article
Lift Contractions
Author/Authors
Golovach، نويسنده , , Petr A. and Kami?ski، نويسنده , , Marcin and Paulusma، نويسنده , , Daniël and Thilikos، نويسنده , , Dimitrios M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
407
To page
412
Abstract
We introduce and study a new containment relation in graphs – lift contractions. H is a lift contraction of G if H can be obtained from G by a sequence of edge lifts and edge contractions. We show that a graph contains every n-vertex graph as a lift contraction, if (1) its treewidth is large enough, or (2) its pathwidth is large enough and it is 2-connected, or (3) its order is large enough and its minimum degree is at least 3.
Keywords
Edge lifts , Contractions , Immersions , Treewidth
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455856
Link To Document