Pages that link to "Item:Q890007"

The following pages link to Labelled induced subgraphs and well-quasi-ordering (Q890007):

Displaying 15 items.

• Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
• Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
• A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
• Letter graphs and modular decomposition (Q2065788) (← links)
• Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
• Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← 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 versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
• Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
• Letter Graphs and Geometric Grid Classes of Permutations (Q5048304) (← 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)
• Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)