A New Applicable Proof of the Euler Circuit Theorem

DOI10.2307/2319893zbMath0337.05125OpenAlexW4232137961MaRDI QIDQ4103564

Alan C. Tucker

Publication date: 1976

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2319893

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Approximation and Exact Algorithms for Special Cases of Connected f-Factors ⋮ Another Proof of Euler’s Circuit Theorem ⋮ Gene assembly through cyclic graph decomposition

This page was built for publication: A New Applicable Proof of the Euler Circuit Theorem