Pages that link to "Item:Q5408613"
From MaRDI portal
The following pages link to Obtaining a Bipartite Graph by Contracting Few Edges (Q5408613):
Displaying 21 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)
- Paths to trees and cacti (Q1998842) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
- On the parameterized complexity of grid contraction (Q2672940) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- (Q5089236) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← 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)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
