The following pages link to (Q3220637):
Displaying 10 items.
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Graphs without \(K_ 4\) and well-quasi-ordering (Q1058531) (← links)
- Perfectly orderable graphs are quasi-parity graphs: a short proof (Q1095159) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- Letter graphs and well-quasi-order by induced subgraphs (Q1349106) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Some new results on cluttered ordering on several special bipartite graphs (Q5137272) (← links)
- The monadic second-order logic of graphs : Definable sets of finite graphs (Q6203539) (← links)
