A proof on cycles and matching in balanced bipartite graphs (Q4901657)
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: A proof on cycles and matching in balanced bipartite graphs |
scientific article; zbMATH DE number 6130095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof on cycles and matching in balanced bipartite graphs |
scientific article; zbMATH DE number 6130095 |
Statements
24 January 2013
0 references
balanced bipartite graph
0 references
circle
0 references
matching
0 references
factor
0 references
0.869192898273468
0 references
0.8304430246353149
0 references
0.8272473812103271
0 references
0.8236165642738342
0 references
