Definition talk:Path (Graph Theory)

Is the comment in braces 'except perhaps the first and last ones' related to possible non-simple graph with single vertex and a loop? Shouldn't this comment be extended to take into account the difference between paths in simple and non-simple graph? --Mloskot (talk) 13:14, 8 January 2013 (UTC)


 * A closed path is still a path. The current definition encompasses the full spread of what a path can be. The first and last vertices may or may not be the same, but all the other vertices must be different. Allowing a single-vertex loop and a single vertex with no edges both to be paths are compatible with this definition. --prime mover (talk) 13:22, 8 January 2013 (UTC)