Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20180 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4243953177 / rank | |||
Normal rank | |||
Revision as of 20:51, 19 March 2024
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
