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.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
AbstractLet k be a positive integer and let G be a k-connected graph. An edge of G is called k-contr...
Conference Name:22nd British Combinatorial Conference. Conference Address: St Andrews, SCOTLAND. Tim...
AbstractWe introduce and study a partial order on graphs—lift-contractions. A graph H is a lift-cont...
We introduce and study a new containment relation in graphs - lift contractions. H is a lift contrac...
We introduce and study a partial order on graphs—lift-contractions. A graph H is a lift-contraction ...
We introduce and study a new containment relation in graphs – lift contractions. H is a lift contrac...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityA graph G is alpha-critical (o...
We study the behavior of lift-and-project procedures for solving combinatorial optimization problems...
Abstract. One proves a contraction principle for a transformation with a closed graph and present tw...
Let u and v be vertices of a graph G, such that the distance between u and v is two and x is a commo...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
Let u and v be vertices of a graph G, such that the distance between u and v is two and x is a commo...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
AbstractLet k be a positive integer and let G be a k-connected graph. An edge of G is called k-contr...
Conference Name:22nd British Combinatorial Conference. Conference Address: St Andrews, SCOTLAND. Tim...
AbstractWe introduce and study a partial order on graphs—lift-contractions. A graph H is a lift-cont...
We introduce and study a new containment relation in graphs - lift contractions. H is a lift contrac...
We introduce and study a partial order on graphs—lift-contractions. A graph H is a lift-contraction ...
We introduce and study a new containment relation in graphs – lift contractions. H is a lift contrac...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityA graph G is alpha-critical (o...
We study the behavior of lift-and-project procedures for solving combinatorial optimization problems...
Abstract. One proves a contraction principle for a transformation with a closed graph and present tw...
Let u and v be vertices of a graph G, such that the distance between u and v is two and x is a commo...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
Let u and v be vertices of a graph G, such that the distance between u and v is two and x is a commo...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
AbstractLet k be a positive integer and let G be a k-connected graph. An edge of G is called k-contr...
Conference Name:22nd British Combinatorial Conference. Conference Address: St Andrews, SCOTLAND. Tim...