Pages that link to "Item:Q5417630"
From MaRDI portal
The following pages link to Directed Nowhere Dense Classes of Graphs (Q5417630):
Displaying 9 items.
- Between treewidth and clique-width (Q300479) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- First-order Logic with Connectivity Operators (Q6082227) (← links)