Abstract
Some special types of graphs, such as paths, cycles and bipartite graphs are defined. We discuss subgraphs of graphs. The problem of visiting all towns in an area exactly once each—Hamilton’s problem—and the problem of doing so as cheaply as possible—the traveling salesman problem—are introduced.
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
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wallis, W.D. (2013). Graphs: Visiting Vertices. In: Mathematics in the Real World. Birkhäuser, New York, NY. https://doi.org/10.1007/978-1-4614-8529-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8529-2_7
Published:
Publisher Name: Birkhäuser, New York, NY
Print ISBN: 978-1-4614-8528-5
Online ISBN: 978-1-4614-8529-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)