Pages that link to "Item:Q3300757"
From MaRDI portal
The following pages link to Path Contraction Faster than $2^n$ (Q3300757):
Displaying 5 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
