Pages that link to "Item:Q1146698"
From MaRDI portal
The following pages link to On the removal of forbidden graphs by edge-deletion or by edge- contraction (Q1146698):
Displayed 19 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Edge-contraction problems (Q794164) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- On the NP-hardness of edge-deletion and -contraction problems (Q1838829) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← 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)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← 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)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)