Letter graphs and well-quasi-order by induced subgraphs
From MaRDI portal
Publication:1349106
DOI10.1016/S0012-365X(01)00094-2zbMath0997.05086MaRDI QIDQ1349106
Publication date: 21 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (28)
The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ Letter Graphs and Geometric Grid Classes of Permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ Word-Representable Graphs: a Survey ⋮ Deciding atomicity of subword-closed languages ⋮ Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ WQO is decidable for factorial languages ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ Bichain graphs: geometric model and universal graphs ⋮ Ramsey numbers and graph parameters ⋮ Critical properties of bipartite permutation graphs ⋮ Induced minors and well-quasi-ordering ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Well-quasi-ordering versus clique-width ⋮ Bipartite induced subgraphs and well-quasi-ordering ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Block-graph width ⋮ Split permutation graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Two forbidden induced subgraphs and well-quasi-ordering ⋮ Letter graphs and geometric grid classes of permutations: characterization and recognition ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Well-quasi-ordering Does Not Imply Bounded Clique-width ⋮ Letter graphs and modular decomposition ⋮ Hereditary classes of graphs: a parametric approach
This page was built for publication: Letter graphs and well-quasi-order by induced subgraphs
