References
- Kenneth Appel and Wolfgang Haken, The solution of the four-color-map problem. Scientific American 237 (Oct. 1977) 108–121 (esp. p. 109).
- A. T. Balaban, A trivalent graph of girth 10, J. Combinatorial Theory Ser. B12 (1972) 1–5; MR 44 #3900.
- Sukhamay Kundu, Bounds on the number of disjoint spanning trees, J. Combinatorial Theory, Ser. B17 (1974) 199–203; MR 51 #5353.
- Horst Sachs, Einführung in die Theorie der endlichen Graphen, vol. II, Teubner, Leipzig, 1972, 126.
- W. T. Tutte, Bridges and Hamiltonian circuits in planar graphs, Aequationes Math. 15(1977) 1–33.
- Hassler Whitney, A theorem on graphs, Ann. of Math. 32 (1931) 378–390; Zbl. 2, 161.