Hamiltonian Cycles on Symmetrical Graphs

Year: 2004 Authors: Carlo H. Séquin

Core claim

Many symmetric graphs, including projections of regular 4D polytopes, can be edge-colored by congruent Hamiltonian cycles while preserving as much symmetry as possible.

Topics

Hamiltonian cycles, graph coloring, symmetry, 4D polytope projections

Domains

graph theory, combinatorics, polytope theory, topological symmetry, geometric visualization, sculptural form, generative design, mathematical art

Methods

manual construction, symmetry-preserving edge coloring, perspective projection, shell-by-shell approach

Media

graph drawings, 3D-printed sculptures, computer-generated models, colored edge diagrams

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.