Graph Theory As I Have Known ItGraph Theory as I Have Known It provides a unique introduction to graph theory by one of the founding fathers, and will appeal to anyone interested in the subject. It is not intended as a comprehensive treatise, but rather as an account of those parts of the theory that have been of special interest to the author. Professor Tutte details his experience in the area, and provides a fascinating insight into how he was led to his theorems and the proofs he used. As well as being of historical interest it provides a useful starting point for research, with references to further suggested books as well as the original papers. The book starts by detailing the first problems worked on by Professor Tutte and his colleagues during his days as an undergraduate member of the Trinity Mathematical Society in Cambridge. It covers subjects such as combinatorial problems in chess, the algebraicization of graph theory, reconstruction of graphs, and the chromatic eigenvalues. In each case fascinating historical and biographical information about the author's research is provided. William Tutte (1917-2002) studied at Cambridge where his fascination for mathematical puzzles brought him into contact with like-minded undergraduates, together becoming known as the 'Trinity four', the founders of modern graph theory. His notable problem-solving skills meant he was brought to Bletchley Park during World War Two. Key in the enemy codebreaking efforts, he cracked the Lorenz cipher for which the Colossus machine was built, making his contribution comparable to Alan Turing's codebreaking for Enigma. Following his incredible war effort Tutte returned to academia and became a fellow of the Royal Society in Britain and Canada, finishing his career as Distinguished Professor Emeritus at the University of Waterloo, Ontario. |
Contents
1 Squaring the square | 1 |
2 Knights errant | 12 |
3 Graphs within graphs | 24 |
4 Unsymmetrical electricity | 34 |
5 Algebra in Graph Theory | 46 |
6 Symmetry in Graphs | 64 |
7 Graphs on spheres | 81 |
8 The Cats of Cheshire | 94 |
Other editions - View all
Common terms and phrases
1-chains algebraic alternating map Beraha bond bridge c-nets called Chapter chromatic polynomials Chromatic sums coboundary coefficients Combinatorial connected graph constrained chromials corresponding cubic graph cubic maps defined deleting dendroid diagram dichromate disjoint dual electrical network end-graphs enumeration equation faces Figure flipping Four Colour Problem Four Colour Theorem function graph G Graph Theory Hamiltonian circuit horizontal identity integer isomorphism class J₁ joined k-colouring Kelly's Lemma loop Math matroid near-triangulations non-separable non-zero nowhere-zero cycle number of vertices odd components partition pentagon perfect rectangles perfect square peripheral circuits Petersen graph planar graph planar maps planar triangulations pole proof reconstructible recursion formula residual result root-edge rooted rotor of order spanning subgraphs spanning trees sphere squared rectangles stator subgraphs subgraphs of G symmetry Tait colouring Tait cycle Tait's Conjecture tree-number triangulated parallelogram triangulations truncated icosahedron valency vertex vertex-deleted subgraphs vertices of attachment vertices of G W.T. Tutte zero