Euler cycle

Show Summary Details

Quick Reference

A path in a directed graph that includes each edge in the graph precisely once; thus it represents a complete traversal of the arcs of the graph. The concept is named for Leonhard Euler who introduced it around 1736 to solve the Königsberg bridges problem. He showed that for a graph to possess an Euler cycle it should be connected and each vertex should have the same number of edges entering it as leaving it.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.