Smallest close to regular bipartite graphs without an almost perfect matching (Q606288)
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: Smallest close to regular bipartite graphs without an almost perfect matching |
scientific article; zbMATH DE number 5816561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Smallest close to regular bipartite graphs without an almost perfect matching |
scientific article; zbMATH DE number 5816561 |
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
0.8953917
0 references
0.88669515
0 references
0.8853259
0 references
0.8840168
0 references
0.88271785
0 references
0 references
0.8820095
0 references
0 references
