An application of coding theory to a problem in graphical enumeration
type: Item
instance of: scholarly article
title: An application of coding theory to a problem in graphical enumeration
zbMATH Open document ID: 0855.05069
DOI: 10.1007/BF01198078
author: Scott A. Vanstone
author: Dieter Jungnickel
published in: Archiv der Mathematik
publication date: 1996-10-20T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 937036
zbMATH Keywords: graphical enumeration
zbMATH Keywords: linear codes
zbMATH Keywords: Read's theorem
zbMATH Keywords: Eulerian graphs
reviewed by: Dieter Jungnickel
MaRDI profile type: Publication
cites work: Q3097395
cites work: Decoding of graph theoretic codes (Corresp.)
cites work: Graph theoretic error-correcting codes
cites work: Graphical codes revisited
cites work: Q4146667
cites work: Euler Graphs on Labelled Nodes
description: scientific article; zbMATH DE number 937036