Pages that link to "Item:Q1045154"
From MaRDI portal
The following pages link to Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154):
Displaying 31 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Matching interdiction (Q602686) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Blocking total dominating sets via edge contractions (Q2034793) (← 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)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← 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)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← 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)
- (Q2857332) (← 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)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- (Q5089236) (← links)
- (Q5092403) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)