Smallest close to regular bipartite graphs without an almost perfect matching (Q606288): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:51, 30 January 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
