Supplementary Reading

Find these papers on MathSciNet (I think you have to be on a UVM machine to get access to it).

[Ai] M. Aigner, The Penrose polynomial of a plane graph,

Math. Ann.,307(1997) 173-189.

[B.i] A. Bouchet, Isotropic Systems,

Europ. J. Combinatorics,8(1987) 231-244.[B.t] A. Bouchet, Tutte-Martin Polynomials and Orienting Vectors of Isotropic Systems,

Graphs and Combinatorics,7(1991) 235-252.[J.t] F. Jaeger, Tutte Polynomials and Link Polynomials,

Proceedings of the American Mathematical Society, vol.103,2, (1988), 647-654.[LV.e] M. Las Vergnas, Eulerian Circuits of 4-Valent Graphs imbedded in Surfaces,

Colloquia Mathematica Societatis Janos Bolyai,25, Algebraic Methods in Graph Theory, Szeged (Hungary), 1978.[LV.oe] M. Las Vergnas, On Eulerian Partitions of Graphs,

Graph Theory and Combinatorics,R.J. Wilson, ed., Research Notes in Mathematics 34, Pitman Advanced Publishing Program, San Francisco, London, Melbourne, (1979), 62-65.[LV.ot] M. Las Vergnas, On the Evaluation at (3,3) of the Tutte Polynomial of a Graph,

Journal of Combinatorial Theory,Series B,44(1988) 367-372.[P.a] R. Penrose, Applications of Negative Dimensional Tensors,

Combinatorial Mathematics and its Applications; Proceedings of a conference held at the Mathematical Institue, Oxford, 1969, London, New York, Academic Press, (1971), 221-244.[T1] W. T. Tutte, A contribution to the theory of chromatic polynomials,

Cand. J. Math.6(1953) 80-81.[T2] W. T. Tutte, On dichromatic polynomials,

J. Combin. Theory,2(1967) 301.[Y] D. Yetter

,On graph invariants given by linear recurrence relations, J. Combin. Theory, Ser. B48(1990) 6-18.