Elementary proofs of (relatively) recent characterizations of Eulerian graphs

DOI10.1016/0166-218X(92)90277-HMaRDI QIDQ1124607zbMATHFDO

Authors Herbert Fleischner

Publication date 1989

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationsEulerian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A proof of McKee's Eulerian-bipartite characterization
• Recharacterizing Eulerian: Intimations of new duality
• scientific article; zbMATH DE number 5016710
• A characterization of binary Eulerian matroids
• New characterizations of Eulerian and bipartite binary matroids

Cites work

• scientific article; zbMATH DE number 3675922 (Why is no real title available?)
• Graph theory
• Parity theorems for paths and cycles in graphs
• Properties of a Euler graph
• Recharacterizing Eulerian: Intimations of new duality

Cited in

(8)

• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• Tosha-degree of an edge in a graph
• Some results in an Eulerian graph
• scientific article; zbMATH DE number 4150213 (Why is no real title available?)
• Cycles containing all the odd-degree vertices
• A proof of McKee's Eulerian-bipartite characterization
• Even poset and a parity result for binary linear code
• Characterizations of postman sets

This page was built for publication: Elementary proofs of (relatively) recent characterizations of Eulerian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124607)