Topic: Eulerian Trails and Circuits

Degree Parity Along an Undirected Trail

Degree Balance in Directed Euler Trails

Constructing Euler Circuits with Hierholzer’s Algorithm

Constructing de Bruijn Sequences From Euler Circuits

Characterizing Open Euler Trails in Digraphs

Building de Bruijn Graphs From Overlapping Words

Balancing Directed Routes for the Chinese Postman

Applying Fleury’s Algorithm When Bridges Are Present

A Six-Vertex Chinese Postman Route by Hand