Hamiltonian graphs are cup-stackable (Q6517054): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:32, 28 November 2024
scientific article; zbMATH DE number 902399341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian graphs are cup-stackable |
scientific article; zbMATH DE number 902399341 |
Statements
Hamiltonian graphs are cup-stackable (English)
0 references
1 January 1 CEGregorian
0 references
