Skip to main content
Open Access Publications from the University of California

On the parity of graph spanning tree numbers


Any bipartite Eulerian graph, any Eulerian graph with evenly many vertices, and any bipartite graph with evenly many vertices and edges, has an even number of spanning trees. More generally, a graph has evenly many spanning trees if and only if it has an Eulerian edge cut.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View