Pages that link to "Item:Q1978642"
From MaRDI portal
The following pages link to Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642):
Displaying 5 items.
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)