Abstract
As you will recall, in the solution of Problem 19.5 we introduced for our convenience the notion of Hamiltonian cycle, or a walk along the edges through all vertices of a graph, that does not repeat a vertex (and therefore, does not repeat any edge) until it ends at the vertex it started from. When such a Hamiltonian cycle exists, the graph is called Hamiltonian.
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
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Soifer, A. (2011). E19. From King Arthur to Mysteries of Hamiltonian Graphs. In: The Colorado Mathematical Olympiad and Further Explorations. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-75472-7_44
Download citation
DOI: https://doi.org/10.1007/978-0-387-75472-7_44
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-75471-0
Online ISBN: 978-0-387-75472-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)