The following pages link to (Q5092403):
Displaying 8 items.
- The reduction of graph families closed under contraction (Q1126283) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction (Q2235275) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (Q2867087) (← links)
- (Q5089236) (← links)
