Pages that link to "Item:Q5408613"
From MaRDI portal
The following pages link to Obtaining a Bipartite Graph by Contracting Few Edges (Q5408613):
Displaying 5 items.
- Graph editing to a fixed target (Q344855) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
