Contracting few edges to remove forbidden induced subgraphs
DOI10.1007/978-3-319-03898-8_10zbMATH Open1406.68037OpenAlexW78635179MaRDI QIDQ2867076FDOQ2867076
Authors: Leizhen Cai, Chengwei Guo 
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_10
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (17)
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
- Paths to trees and cacti
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- Reducing the vertex cover number via edge contractions
- On the parameterized complexity of contraction to generalization of trees
- Contraction Blockers for Graphs with Forbidden Induced Paths
- On the Parameterized Complexity of Contraction to Generalization of Trees.
- Parameterized complexity of three edge contraction problems with degree constraints
- Obtaining split graphs by edge contraction
- On the parameterized complexity of maximum degree contraction problem
- Contracting to a longest path in H-free graphs
- Hadwiger Number of Graphs with Small Chordality
- Forbidden induced subgraph characterization of cograph contractions
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- On the parameterized complexity of grid contraction
- A single exponential-time FPT algorithm for cactus contraction
- Paths to Trees and Cacti
This page was built for publication: Contracting few edges to remove forbidden induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867076)
