An application of coding theory to a problem in graphical enumeration (Q1924570)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An application of coding theory to a problem in graphical enumeration |
scientific article; zbMATH DE number 937036
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of coding theory to a problem in graphical enumeration |
scientific article; zbMATH DE number 937036 |
Statements
An application of coding theory to a problem in graphical enumeration (English)
0 references
20 October 1996
0 references
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.
0 references
graphical enumeration
0 references
linear codes
0 references
Read's theorem
0 references
Eulerian graphs
0 references
