Properties of a Euler graph

DOI10.1016/0016-0032(73)90046-XMaRDI QIDQ1231500zbMATH OpenFDO

Authors Shunichi Toida

Publication date 1973

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(10)

• Even poset and a parity result for binary linear code
• A parity theorem about trees with specified degrees
• Elementary proofs of (relatively) recent characterizations of Eulerian graphs
• A proof of McKee's Eulerian-bipartite characterization
• scientific article; zbMATH DE number 2230195 (Why is no real title available?)
• On the sizes of generalized cactus graphs
• Cycles containing all the odd-degree vertices
• Recharacterizing Eulerian: Intimations of new duality
• Characterizations of postman sets
• Some graphic uses of an even number of odd nodes

This page was built for publication: Properties of a Euler graph

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