An application of coding theory to a problem in graphical enumeration
By viewing the cycle space and the bond space of a graph as binary linear codes, we obtain a very short and elegant proof of Read's theorem giving the generating function for the number of Eulerian graphs with \(p\) vertices and an analogous (to our knowledge new) theorem concerning bipartite Eulerian graphs.
scientific article; zbMATH DE number 937036