It was written by Derek Holton and John Sheehan, and published in 1993 by the Cambridge University Press as volume 7 in their Australian Mathematical Society Lecture Series.

[3] Chapter six of the book concerns cages, the smallest regular graphs with no cycles shorter than a given length.

[3] It can be used as a reference work for researchers in this area,[1][2] or as the basis of an advanced course in graph theory.

[2][3] Although Carsten Thomassen describes the book as "elegant",[4] and Robin Wilson evaluates its exposition as "generally good",[2] reviewer Charles H. C. Little takes the opposite view, finding fault with its copyediting, with some of its mathematical notation, and with its failure to discuss the lattice of integer combinations of perfect matchings, in which the number of copies of the Petersen graph in the "bricks" of a certain graph decomposition plays a key role in computing the dimension.

[1] Reviewer Ian Anderson notes the superficiality of some of its coverage, but concludes that the book "succeeds in giving an exciting and enthusiastic glimpse" of graph theory.