Pages that link to "Item:Q603891"
From MaRDI portal
The following pages link to Well-quasi-order of relabel functions (Q603891):
Displaying 16 items.
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Split permutation graphs (Q2014716) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← 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)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- Induced betweenness in order-theoretic trees (Q5038203) (← 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)
- A class of graphs with large rankwidth (Q6080165) (← links)
- When locality meets preservation (Q6649481) (← links)
