A proof of McKee's Eulerian-bipartite characterization

DOI10.1016/0012-365X(90)90380-ZzbMath0744.05030OpenAlexW2025853064MaRDI QIDQ1814018

Douglas R. Woodall

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90380-z

zbMATH Keywords

binary matroidsconnected graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Counting maximal cycles in binary matroids ⋮ Even poset and a parity result for binary linear code ⋮ Characterizations of postman sets ⋮ Parity and disparity subgraphs ⋮ Unnamed Item

Cites Work

• Recharacterizing Eulerian: Intimations of new duality
• Properties of a Euler graph
• On Vector Spaces Associated with a Graph
• The Decomposition of a Graph and the Introduction of a New Class of Subgraphs

This page was built for publication: A proof of McKee's Eulerian-bipartite characterization