Canonical antichains of unit interval and bipartite permutation graphs

DOI10.1007/s11083-010-9188-7zbMath1234.05222OpenAlexW2023990208MaRDI QIDQ651422

Vadim V. Lozin, Colin Mayhill

Publication date: 13 December 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9188-7

zbMATH Keywords

antichaininduced subgraphswell-quasi-order

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph minors (05C83)

Related Items (6)

Labelled well-quasi-order for permutation classes ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Critical properties of bipartite permutation graphs ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Split permutation graphs ⋮ Unnamed Item

Cites Work

• Minimal classes of graphs of unbounded clique-width
• Stable sets versus independent sets
• Graph minors. XX: Wagner's conjecture
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs
• On canonical antichains
• Split graphs of Dilworth number 2
• Bipartite permutation graphs
• Optimal path cover problem on block graphs and bipartite permutation graphs
• A short proof that `proper = unit'
• Letter graphs and well-quasi-order by induced subgraphs
• Proper interval graphs and the guard problem
• Decompositions for the edge colouring of reduced indifference graphs.
• Jump number maximization for proper interval graphs and series-parallel graphs
• Precoloring extension on unit interval graphs
• A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
• Subgraphs and well‐quasi‐ordering
• Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Canonical antichains of unit interval and bipartite permutation graphs