Pages that link to "Item:Q2835660"
From MaRDI portal
The following pages link to Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660):
Displaying 15 items.
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Blocking total dominating sets via edge contractions (Q2034793) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Using edge contractions and vertex deletions to reduce the independence number and the clique number (Q2169976) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
- Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes (Q4229261) (← links)
- (Q5092403) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- Reducing graph parameters by contractions and deletions (Q6119833) (← links)
- On blockers and transversals of maximum independent sets in co-comparability graphs (Q6585269) (← links)