Elementary proofs of (relatively) recent characterizations of Eulerian graphs
type: Item
instance of: scholarly article
title: Elementary proofs of (relatively) recent characterizations of Eulerian graphs
zbMATH Open document ID: 0679.05050
DOI: 10.1016/0166-218X(92)90277-H
author: Herbert Fleischner
published in: Discrete Applied Mathematics
publication date: 1989-01-01T00:00:00Z
review text: Toida showed that if a graph is Eulerian, then each edge belongs to an odd number of cycles. McKee established the converse of this implication using matroid theory. Shank used properties of binary vector spaces to show that a connected graph G is Eulerian if and only if the number of subsets of E(G) each of which is contained in a spanning tree of G, is odd. The author provides in this paper graph theoretical proofs of these results.
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 4112638
zbMATH Keywords: Eulerian graphs
zbMATH Keywords: characterizations
reviewed by: Ortrud R. Oellermann
MaRDI profile type: Publication
cites work: Q5422499
cites work: Parity theorems for paths and cycles in graphs
cites work: Recharacterizing Eulerian: Intimations of new duality
cites work: Q3872484
cites work: Properties of a Euler graph
description: scientific article; zbMATH DE number 4112638