Show Summary Details

p. 866. Graphslocked

  • Robin Wilson


Graph theory is about collections of points that are joined in pairs, such as a road map with towns connected by roads or a molecule with atoms joined by chemical bonds. ‘Graphs’ revisits the Königsberg bridges problem, the knight’s tour problem, the Gas–Water–Electricity problem, the map-colour problem, the minimum connector problem, and the travelling salesman problem and explains how they can all be considered as problems in graph theory. It begins with an explanation of a graph and describes the complete graph, the complete bipartite graph, and the cycle graph, which are all simple graphs. It goes on to describe trees in graph theory, Eulerian and Hamiltonian graphs, and planar graphs.

Access to the complete content on Very Short Introductions online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can't find the answer there, please contact us.