Elementary proofs of (relatively) recent characterizations of Eulerian graphs

DOI10.1016/0166-218X(92)90277-HzbMATH Open0679.05050MaRDI QIDQ1124607FDOQ1124607

Authors: Herbert Fleischner 

Publication date: 1989

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

Recommendations

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

zbMATH Keywords

characterizationsEulerian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Graph theory
• Properties of a Euler graph
• Recharacterizing Eulerian: Intimations of new duality
• Parity theorems for paths and cycles in graphs
• Title not available (Why is that?)

Cited In (8)

• Tosha-degree of an edge in a graph
• Even poset and a parity result for binary linear code
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A proof of McKee's Eulerian-bipartite characterization
• Some results in an Eulerian graph
• Title not available (Why is that?)
• Cycles containing all the odd-degree vertices
• 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)