This paper by W. T. Tutte introduces two polynomials, θ(G, n) and φ(G, n), related to graph colorings. It proves a new result for φ(G, n), a less-known polynomial, and highlights unsolved problems related to it, which are natural generalizations of the Four Colour Problem to general graphs. A two-variable polynomial χ(G, x, y) is studied, which generalizes both θ(G, n) and φ(G, n). For connected graphs, χ(G, x, y) is defined using spanning trees and edge enumeration, and its invariance under enumeration changes is a new result about spanning trees. The paper links the theory of graph colorings to electrical networks through spanning trees. It discusses color-coboundaries and color-cycles, and proves that φ(G, n) vanishes if G has an isthmus. The paper also presents conjectures about φ(G, n) for graphs without isthmuses and provides a theorem showing that if φ(G, n) > 0, then φ(G, n+1) > 0. It defines the dichromate χ(G, x, y) as a generalization of both θ(G, n) and φ(G, n), and shows that it is invariant under edge enumeration. The dichromate is used to derive formulas for θ(G, n) and φ(G, n) in terms of χ(G, x, y). The paper concludes by linking the theory of spanning trees to graph colorings and electrical networks.This paper by W. T. Tutte introduces two polynomials, θ(G, n) and φ(G, n), related to graph colorings. It proves a new result for φ(G, n), a less-known polynomial, and highlights unsolved problems related to it, which are natural generalizations of the Four Colour Problem to general graphs. A two-variable polynomial χ(G, x, y) is studied, which generalizes both θ(G, n) and φ(G, n). For connected graphs, χ(G, x, y) is defined using spanning trees and edge enumeration, and its invariance under enumeration changes is a new result about spanning trees. The paper links the theory of graph colorings to electrical networks through spanning trees. It discusses color-coboundaries and color-cycles, and proves that φ(G, n) vanishes if G has an isthmus. The paper also presents conjectures about φ(G, n) for graphs without isthmuses and provides a theorem showing that if φ(G, n) > 0, then φ(G, n+1) > 0. It defines the dichromate χ(G, x, y) as a generalization of both θ(G, n) and φ(G, n), and shows that it is invariant under edge enumeration. The dichromate is used to derive formulas for θ(G, n) and φ(G, n) in terms of χ(G, x, y). The paper concludes by linking the theory of spanning trees to graph colorings and electrical networks.