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