International audienceWe show that the class of multigraphs with at most p connected components and bonds of size at most k is well-quasi-ordered by edge contraction for all positive integers p, k. (A bond is a minimal non-empty edge cut.) We also characterize canonical antichains for this relation and show that they are fundamental
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
We introduce and study a new containment relation in graphs - lift contractions. H is a lift contrac...
This paper addresses a problem posed by Oxley (Matroid Theory, Cambridge University Press, Cambridge...
International audienceWe show that the class of multigraphs with at most p connected components and ...
International audienceWe show that the class of multigraphs with at most p connected components and ...
International audienceWe show that the class of multigraphs with at most p connected components and ...
International audienceWe show that the class of multigraphs with at most p connected components and ...
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 ...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-or...
AbstractLet k≥1,l>0,m≥0 be integers, and let Ck(l,m) denote the graph family such that a graph G of ...
Conference Name:22nd British Combinatorial Conference. Conference Address: St Andrews, SCOTLAND. Tim...
The central theme of this thesis is the study of the properties of the classes of graphs defined by ...
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
We introduce and study a new containment relation in graphs - lift contractions. H is a lift contrac...
This paper addresses a problem posed by Oxley (Matroid Theory, Cambridge University Press, Cambridge...
International audienceWe show that the class of multigraphs with at most p connected components and ...
International audienceWe show that the class of multigraphs with at most p connected components and ...
International audienceWe show that the class of multigraphs with at most p connected components and ...
International audienceWe show that the class of multigraphs with at most p connected components and ...
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 ...
International audienceA well-quasi-order is an order which contains no infinite decreasing sequence ...
It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-or...
AbstractLet k≥1,l>0,m≥0 be integers, and let Ck(l,m) denote the graph family such that a graph G of ...
Conference Name:22nd British Combinatorial Conference. Conference Address: St Andrews, SCOTLAND. Tim...
The central theme of this thesis is the study of the properties of the classes of graphs defined by ...
AbstractCall a subset of an ordered set a fibre if it meets every maximal antichain. We prove severa...
We introduce and study a new containment relation in graphs - lift contractions. H is a lift contrac...
This paper addresses a problem posed by Oxley (Matroid Theory, Cambridge University Press, Cambridge...
DOI
Add to ORKG