A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH (Q3963025): 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.1093/qmath/33.3.297 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992132713 / rank | |||
Normal rank | |||
Latest revision as of 03:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH |
scientific article |
Statements
A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH (English)
0 references
1982
0 references
independence structure
0 references
matchings
0 references
bipartite graph
0 references
Hall's theorem
0 references
