Pages that link to "Item:Q4419764"
From MaRDI portal
The following pages link to Deleting vertices to bound path length (Q4419764):
Displayed 6 items.
- Using edge contractions and vertex deletions to reduce the independence number and the clique number (Q2169976) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- (Q3191594) (← links)
- (Q5111863) (← links)
- Reducing graph parameters by contractions and deletions (Q6119833) (← links)