Abstract
In this chapter we consider various problems relating to the existence of certain types of walk in a graph. The reader should recall the definitions of walk, path, cycle and trail given in Section 3.2. The Königsberg bridge problem concerns the existence of a trail which is closed and contains all the edges of the graph. We study such (Eulerian) trails in more detail, but first we look at a related type of problem associated with the name of the Irish mathematician Sir William Rowan Hamilton (1805–1865).
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
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Anderson, I. (2002). Travelling Round a Graph. In: A First Course in Discrete Mathematics. Springer Undergraduate Mathematics Series. Springer, London. https://doi.org/10.1007/978-0-85729-315-2_4
Download citation
DOI: https://doi.org/10.1007/978-0-85729-315-2_4
Publisher Name: Springer, London
Print ISBN: 978-1-85233-236-5
Online ISBN: 978-0-85729-315-2
eBook Packages: Springer Book Archive