Abstract
The famous mathematician Leonhard Euler posed the Königsberg Bridges Problem: Can you cross all seven bridges exactly once on a walk and then return to the starting point? This playful question has important applications in fields such as route planning. In this chapter the authors show how to determine whether an Eulerian circuit exists in a figure, and in so doing they show how to solve problems such as the well-known “House of Santa Claus” riddle.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Behrisch, M., Coja-Oghlan, A., Liske, P. (2011). Eulerian Circuits. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)