Encyclopedia.com > Dictionaries, Thesauruses, Pictures, and Press Releases > A Dictionary of Computing > January 2004

Euler cycle

A Dictionary of Computing | 2004 | 442 words | Copyright

Euler cycle (Euler path) 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.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

JOHN DAINTITH. "Euler cycle." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "Euler cycle." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-Eulercycle.html

JOHN DAINTITH. "Euler cycle." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-Eulercycle.html

Learn more about citation styles

Find thousands of answers for hundreds of subjects at Answers Encyclopedia .

All answers verified by trusted sources at Encyclopedia.com

Try Answers Encyclopedia now!

For students and teachers!

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including:

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including: