On canonical antichains

DOI10.1016/j.disc.2007.12.018zbMath1219.06001OpenAlexW2047255619MaRDI QIDQ1011785

Guoli Ding

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.018

zbMATH Keywords

induced subgraphwell-quasi-orderingsubgraphinfinite antichain

Mathematics Subject Classification ID

Partial orders, general (06A06) Structural characterization of families of graphs (05C75)

Related Items (6)

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ Well-quasi-ordering \(H\)-contraction-free graphs ⋮ Infinitely many minimal classes of graphs of unbounded clique-width ⋮ Induced minors and well-quasi-ordering ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Split permutation graphs

Cites Work

• Graph minors. XX: Wagner's conjecture
• The theory of well-quasi-ordering: a frequently discovered concept
• Subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: On canonical antichains