Pages that link to "Item:Q1764809"
From MaRDI portal
The following pages link to Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809):
Displaying 7 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
