On Traversing Graphs

DOI10.2307/2315469MaRDI QIDQ5515140zbMATH OpenOpenAlexFDO

Authors D. J. Troy

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

zbMATH Keywords

topology

Cited in

(5)

• Searching for a strong double tracing in a graph
• Antiparallel \(d\)-stable traces and a stronger version of ore problem
• Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
• Deriving graphs with a retracting-free bidirectional double tracing
• Bidirectional retracting-free double tracings and upper embeddability of graphs

This page was built for publication: On Traversing Graphs

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