par Golovach, Petr A.;Paulusma, Daniël;Kaminski, Marcin 
;Thilikos Touloupas, Dimitrios
Référence European journal of combinatorics, 35, page (286-296)
Publication Publié, 2014-01
;Thilikos Touloupas, Dimitrios Référence European journal of combinatorics, 35, page (286-296)
Publication Publié, 2014-01
Article révisé par les pairs
| Résumé : | 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. © 2013 Elsevier Ltd. |
