6. Graphs
2016 ◽
pp. 86-108
Keyword(s):
Road Map
◽
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.
1970 ◽
Vol 22
(5)
◽
pp. 1082-1096
◽
2006 ◽
Vol 15
(01)
◽
pp. 11-19
◽
Keyword(s):
1969 ◽
Vol 21
◽
pp. 1086-1096
◽
Keyword(s):
2011 ◽
Vol 3
(2)
◽
pp. 321-329
◽
Keyword(s):
2018 ◽
Vol 106
(2)
◽
pp. 515-527
2015 ◽
Vol 07
(04)
◽
pp. 1550040
◽
Keyword(s):
2013 ◽
Vol 23
(1)
◽
pp. 50-65
◽
2009 ◽
Vol 86
(1)
◽
pp. 111-122
◽
Keyword(s):
2017 ◽
Vol 104
(1)
◽
pp. 127-144
Keyword(s):