On Traversing Graphs
From MaRDI portal
Publication:5515140
DOI10.2307/2315469zbMath0139.41404OpenAlexW2335700925MaRDI QIDQ5515140
Publication date: 1966
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2315469
Related Items (5)
Deriving graphs with a retracting-free bidirectional double tracing ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ Searching for a strong double tracing in a graph ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs
This page was built for publication: On Traversing Graphs
