Pages that link to "Item:Q2275404"
From MaRDI portal
The following pages link to Two forbidden induced subgraphs and well-quasi-ordering (Q2275404):
Displaying 23 items.
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← 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 versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- Deciding the Bell Number for Hereditary Graph Properties (Q5890662) (← 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)
- WQO dichotomy for 3-graphs (Q5919047) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
