On canonical antichains

DOI10.1016/J.DISC.2007.12.018MaRDI QIDQ1011785zbMATH OpenOpenAlexFDO

Authors 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 subgraphinfinite antichainsubgraphwell-quasi-ordering

Mathematics Subject Classification ID

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

Recommendations

• Canonical antichains of unit interval and bipartite permutation graphs
• Finiteness theorems for graphs and posets obtained by compositions
• Subgraphs and well‐quasi‐ordering
• Minimal antichains in well-founded quasi-orders with an application to tournaments
• Labelled induced subgraphs and well-quasi-ordering

Cites work

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

Cited in

(10)

• Finiteness theorems for graphs and posets obtained by compositions
• Minimal antichains in well-founded quasi-orders with an application to tournaments
• Split permutation graphs
• Well-quasi-ordering \(H\)-contraction-free graphs
• Infinitely many minimal classes of graphs of unbounded clique-width
• Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
• scientific article; zbMATH DE number 1051291 (Why is no real title available?)
• On the existence of small antichains for definable quasi-orders
• Antichains and counterpoint dichotomies
• Canonical antichains of unit interval and bipartite permutation graphs

This page was built for publication: On canonical antichains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011785)