Topic: Eulerian Trails and Circuits

Why Fleury’s Algorithm Produces an Euler Trail

Turning an Open Euler Trail Into a Circuit

The Chinese Postman Problem as Edge Duplication

Proving the Undirected Euler Circuit Characterization

Odd-Vertex Pairing for the Undirected Chinese Postman

Necessary Conditions for Undirected Euler Trails

Isolated Vertices and Disconnected Eulerian Graphs

Fleury’s Rule for Choosing the Next Edge

Euler Trails, Circuits, and Edge-Use Conventions

Directed Euler Circuits: Connectivity and Balance