Pages that link to "Item:Q671437"
From MaRDI portal
The following pages link to The complexity of subgraph isomorphism for classes of partial k-trees (Q671437):
Displayed 4 items.
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)