• Christian LindorferEmail author
Part of the BestMasters book series (BEST)


Imagine the following discrete process: You are starting at a vertex of a given undirected graph. In every step you can choose any edge leaving the current vertex and follow this edge to a new vertex. The only rule is that you must not return to any vertex already visited during the process.

Copyright information

© Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2018

Authors and Affiliations

  1. 1.GrazAustria

Personalised recommendations