Finding maximum square-free 2-matchings in bipartite graphs (Q2498740)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum square-free 2-matchings in bipartite graphs |
scientific article |
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
