A problem regarding the tracing of graphs
From MaRDI portal
Publication:2649506
zbMath0043.38503MaRDI QIDQ2649506
No author found.
Publication date: 1951
Published in: Elemente der Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/140566
Related Items (16)
Deriving graphs with a retracting-free bidirectional double tracing ⋮ $k$-path Euler graphs ⋮ Randomly planar graphs ⋮ Arbitrarily traceable graphs and digraphs ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ Maximum cycle packing in Eulerian graphs using local traces ⋮ Packing Euler graphs with traces ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ Randomly Eulerian digraphs ⋮ General degree-eccentricity index of trees ⋮ Searching for a strong double tracing in a graph ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs ⋮ Unnamed Item
This page was built for publication: A problem regarding the tracing of graphs
