Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) (Q1036825)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) |
scientific article; zbMATH DE number 5632816
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) |
scientific article; zbMATH DE number 5632816 |
Statements
Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) (English)
0 references
13 November 2009
0 references
Hamiltonian cycle
0 references
token ring
0 references
diameter
0 references
binary tree
0 references
graph algorithm
0 references
Hamiltonian graphs
0 references
