Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms |
scientific article |
Statements
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (English)
0 references
7 February 2007
0 references
blockers
0 references
generation algorithms
0 references
matchable graphs
0 references
