Abstract
EULER TRAIL: A trail in G is said to be an Euler Trail if it includes all the edges of graph G. Thus a trail is Euler if each edge of G is in the trail exactly once.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer India
About this chapter
Cite this chapter
Ray, S. (2013). Euler Graphs and Hamiltonian Graphs. In: Graph Theory with Algorithms and its Applications. Springer, India. https://doi.org/10.1007/978-81-322-0750-4_3
Download citation
DOI: https://doi.org/10.1007/978-81-322-0750-4_3
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-0749-8
Online ISBN: 978-81-322-0750-4
eBook Packages: EngineeringEngineering (R0)