DMCA
Hamiltonian Cycles on Symmetrical Graphs (2004)
| Venue: | BRIDGES Conference Proceedings, pp 211-222, Winfield KS, Jul.30 - Aug.1 |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Séquin04hamiltoniancycles,
author = {Carlo H. Séquin},
title = {Hamiltonian Cycles on Symmetrical Graphs},
booktitle = {BRIDGES Conference Proceedings, pp 211-222, Winfield KS, Jul.30 - Aug.1},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The edges of highly-connected symmetrical graphs are colored so that they form Hamiltonian cycles. As an introduction we discuss the coloring of the complete graphs K 2m+1 for m>1, but the focus is on the graphs resulting from symmetrical perspective projections of the edges of the regular 4-dimensional polytopes into 3-space. The goal is to color all edges in these graphs with multiple congruent copies of Hamiltonian cycles exhibiting as much symmetry as possible. Figure 1: Map of Königsberg (a) and equivalent graph (b). 1.
