On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three (Q2930057)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three |
scientific article |
Statements
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three (English)
0 references
17 November 2014
0 references
random graph
0 references
given minimum degree
0 references
Hamilton cycle
0 references
2-matching
0 references
0 references
0 references
