Induced subgraphs and well‐quasi‐ordering

DOI10.1002/jgt.3190140406zbMath0721.05059OpenAlexW2007843697WikidataQ55954274 ScholiaQ55954274MaRDI QIDQ5752616

Peter Damaschke

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140406

zbMATH Keywords

WQOwell-quasi-orderedlower ideals

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (05C99)

Related Items (34)

The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ Labelled well-quasi-order for permutation classes ⋮ Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ WQO is decidable for factorial languages ⋮ Well-quasi-order of relabel functions ⋮ Boundary properties of well-quasi-ordered sets of graphs ⋮ Obstructions to partitions of chordal graphs ⋮ Well-quasi-ordering \(H\)-contraction-free graphs ⋮ Minimal obstructions to 2-polar cographs ⋮ Minimal obstructions to \(( s , 1 )\)-polarity in cographs ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ Linear Clique‐Width for Hereditary Classes of Cographs ⋮ 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 ⋮ A counterexample regarding labelled well-quasi-ordering ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Split permutation graphs ⋮ Two forbidden induced subgraphs and well-quasi-ordering ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Letter graphs and geometric grid classes of permutations: characterization and recognition ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Minimal obstructions to \(( \infty , k )\)-polarity in cographs ⋮ Graph partitions with prescribed patterns ⋮ Characterizations of cographs as intersection graphs of paths on a grid ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes ⋮ Well-quasi-ordering Does Not Imply Bounded Clique-width ⋮ Unavoidable doubly connected large graphs ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph ⋮ On well quasi-order of graph classes under homomorphic image orderings

This page was built for publication: Induced subgraphs and well‐quasi‐ordering