0

As I understand it, a Hamiltonian path visits every vertex of a graph exactly once. Is there a name for a path which visits every vertex at least once?

Some graphs may be such that a cycle visiting every vertex, must visit some vertices more than once. I'd like to talk about the shortest such cycles.

Jim Newton
  • 594
  • 3
  • 16
  • 1
    Since this question is purely about discrete mathematics, not programming or computer science specifically, it would be better asked at https://math.stackexchange.com/ – kaya3 Mar 05 '21 at 08:27
  • 1
    OK, done. https://math.stackexchange.com/questions/4049861/what-is-a-path-called-that-visits-every-vertex-of-a-graph-at-least-once?noredirect=1#comment8364429_4049861 – Jim Newton Mar 05 '21 at 09:27

0 Answers0