Pages that link to "Item:Q489343"

The following pages link to Blockers for the stability number and the chromatic number (Q489343):

Displaying 18 items.

• Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
• Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
• Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
• Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
• Reducing graph transversals via edge contractions (Q2037191) (← links)
• Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
• Using edge contractions to reduce the semitotal domination number (Q2098176) (← 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)
• Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
• Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
• Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
• (Q5089236) (← links)
• Reducing the vertex cover number via edge contractions (Q6098145) (← links)
• Reducing graph parameters by contractions and deletions (Q6119833) (← links)
• On blockers and transversals of maximum independent sets in co-comparability graphs (Q6585269) (← links)
• Distance-preserving graph compression techniques (Q6616229) (← links)