The square of every two-connected graph is Hamiltonian (Q2558870)
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 3404277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The square of every two-connected graph is Hamiltonian |
scientific article; zbMATH DE number 3404277 |
Statements
The square of every two-connected graph is Hamiltonian (English)
0 references
1974
0 references
0 references
