Finding Optimal Paths in Beadworks: What If Euler Were a Beader?

Year: 2013 Authors: Ron Asherov

Core claim

Regular beadwork graphs admit an optimal beadable path corresponding to an Eulerian path in the line graph under the sides constraint.

Topics

graph theory, beadwork design, Eulerian paths, line graphs, symmetry

Domains

graph theory, Eulerian paths, line graphs, regular graphs, craft, jewelry design, ornamental patterning, textile-inspired construction

Methods

graph modeling, line graph transformation, Hierholzer’s algorithm, heuristic path construction

Media

beads, nylon string, acrylic beads, glass beads, bugle beads

Source status

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