The square of every two-connected graph is Hamiltonian (Q2558870)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The square of every two-connected graph is Hamiltonian |
scientific article |
Statements
The square of every two-connected graph is Hamiltonian (English)
0 references
1974
0 references
0 references
