Pages that link to "Item:Q3419712"
From MaRDI portal
The following pages link to Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712):
Displaying 8 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Matching interdiction (Q602686) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product (Q2028067) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
