Recharacterizing Eulerian: Intimations of new duality

Abstract Eulerian graphs are shown to be characterized by being connected with each edge in an odd number of circuits, as compared with the traditional characterization having each cutset contain an even number of edges. This result is proved in the general context of binary matroids, and the intriguing sort of duality present is analyzed using syntactical duality principles.

[1]  Shunichi Toida,et al.  Properties of a Euler graph , 1973 .

[2]  Robin J. Wilson.  Introduction to Graph Theory , 1974 .

[3]  Terry A. McKee,et al.  A quantifier for matroid duality , 1981, Discret. Math..

[4]  T. A. McKee,et al.  Logical Aspects of Combinatorial Duality , 1984, Canadian Mathematical Bulletin.

[5]  Terry A. McKee.  Duality principles for binary matroids and graphs , 1983, Discret. Math..