Abstract
A cycle in a graph is called Eulerian if it contains all edges of the graph. (Recall that by definition any edge may enter a cycle at most once.) A connected graph with an Eulerian cycle is called Eulerian.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Melnikov, O., Sarvanov, V., Tyshkevich, R., Yemelichev, V., Zverovich, I. (1998). Graph Traversals. In: Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1514-0_8
Download citation
DOI: https://doi.org/10.1007/978-94-017-1514-0_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4979-7
Online ISBN: 978-94-017-1514-0
eBook Packages: Springer Book Archive