Pages that link to "Item:Q1122982"
From MaRDI portal
The following pages link to On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982):
Displaying 6 items.
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- The hardest halfspace (Q1983325) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
