Pages that link to "Item:Q1124607"
From MaRDI portal
The following pages link to Elementary proofs of (relatively) recent characterizations of Eulerian graphs (Q1124607):
Displaying 5 items.
- Even poset and a parity result for binary linear code (Q855546) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- A proof of McKee's Eulerian-bipartite characterization (Q1814018) (← links)
- Cycles containing all the odd-degree vertices (Q2173434) (← links)
- Characterizations of postman sets (Q2483397) (← links)