Pages that link to "Item:Q1349106"
From MaRDI portal
The following pages link to Letter graphs and well-quasi-order by induced subgraphs (Q1349106):
Displaying 20 items.
- Block-graph width (Q534563) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- The micro-world of cographs (Q831855) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Split permutation graphs (Q2014716) (← links)
- Letter graphs and modular decomposition (Q2065788) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- Deciding atomicity of subword-closed languages (Q2163979) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- Ramsey numbers and graph parameters (Q6121914) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
