Smallest close to regular bipartite graphs without an almost perfect matching (Q606288): 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.1007/s10114-010-9124-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075182507 / rank | |||
Normal rank | |||
Revision as of 21:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smallest close to regular bipartite graphs without an almost perfect matching |
scientific article |
Statements
Smallest close to regular bipartite graphs without an almost perfect matching (English)
0 references
17 November 2010
0 references
almost perfect matching
0 references
bipartite graph
0 references
close to regular graph
0 references
