The following pages link to (Q2911626):
Displayed 8 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)