Elementary proofs of (relatively) recent characterizations of Eulerian graphs
From MaRDI portal
Publication:1124607
DOI10.1016/0166-218X(92)90277-HzbMath0679.05050MaRDI QIDQ1124607
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (2)
Even poset and a parity result for binary linear code ⋮ Cycles containing all the odd-degree vertices
Cites Work
This page was built for publication: Elementary proofs of (relatively) recent characterizations of Eulerian graphs