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 9 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)
