The following pages link to Edge-contraction problems (Q794164):
Displaying 22 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks (Q6162049) (← links)
