Pages that link to "Item:Q5752616"
From MaRDI portal
The following pages link to Induced subgraphs and well‐quasi‐ordering (Q5752616):
Displaying 34 items.
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Well-quasi-order of relabel functions (Q603891) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- The micro-world of cographs (Q831855) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Unavoidable doubly connected large graphs (Q1827667) (← links)
- Split permutation graphs (Q2014716) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- On well quasi-order of graph classes under homomorphic image orderings (Q2357228) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Well-quasi-ordering \(H\)-contraction-free graphs (Q2413963) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- The Micro-world of Cographs (Q5041177) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- Induced minors and well-quasi-ordering (Q5890902) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Letter graphs and geometric grid classes of permutations: characterization and recognition (Q5918890) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)