AbstractIt is proved that given an infinite sequence G1, G2, G3,…, of series-parallel graphs there are indices i < j such that Gj contains an induced subgraph contractable onto Gi. An example is given showing that for planar graphs the preceding theorem fails
Does well-quasi-ordering by induced subgraphs imply bounded clique-width for hereditary classes? Thi...
AbstractWe show that perfectly orderable graphs are quasi-parity graphs by exhibiting two nodes whic...
We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. ...
Korpelainen, Lozin, and Razgon conjectured that a hereditary property of graphs which is well-quasi-...
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 ...
AbstractG′ ≤ G means that G contains a subdivision of G′ and we define G′ ≤ G if and only if G is co...
A quasi-order is a reflexive and transitive relation. A quasi-ordered set (Q, ⩽) consists of a set Q...
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to disting...
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to disting...
A quasi-order is a reflexive and transitive relation. A quasi-ordered set (Q, ⩽) consists of a set Q...
In this work we study the notion of well-quasi-ordering for various partial orders and its relation ...
Robertson and Seymour proved Wagner\u27s Conjecture, which says that finite graphs are well-quasi-or...
Does well-quasi-ordering by induced subgraphs imply bounded clique-width for hereditary classes? Thi...
AbstractWe show that perfectly orderable graphs are quasi-parity graphs by exhibiting two nodes whic...
We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. ...
Korpelainen, Lozin, and Razgon conjectured that a hereditary property of graphs which is well-quasi-...
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 ...
AbstractG′ ≤ G means that G contains a subdivision of G′ and we define G′ ≤ G if and only if G is co...
A quasi-order is a reflexive and transitive relation. A quasi-ordered set (Q, ⩽) consists of a set Q...
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to disting...
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to disting...
A quasi-order is a reflexive and transitive relation. A quasi-ordered set (Q, ⩽) consists of a set Q...
In this work we study the notion of well-quasi-ordering for various partial orders and its relation ...
Robertson and Seymour proved Wagner\u27s Conjecture, which says that finite graphs are well-quasi-or...
Does well-quasi-ordering by induced subgraphs imply bounded clique-width for hereditary classes? Thi...
AbstractWe show that perfectly orderable graphs are quasi-parity graphs by exhibiting two nodes whic...
We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. ...
DOI
Add to ORKG