Finding maximum square-free 2-matchings in bipartite graphs (Q2498740)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5047074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding maximum square-free 2-matchings in bipartite graphs |
scientific article; zbMATH DE number 5047074 |
Statements
Finding maximum square-free 2-matchings in bipartite graphs (English)
0 references
16 August 2006
0 references
matchings
0 references
Hamilton cycles
0 references
0.8864148855209351
0 references
0.8729553818702698
0 references
0.8715202808380127
0 references
0.8378355503082275
0 references
