Graph walks and simple paths
In a finite undirected simple graph, a walk requires each consecutive pair of vertices to be adjacent; a simple path additionally requires all vertices to be distinct.
atlas-graph-walk-simple-path · canonical_mko
Graph walks and simple paths
This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.
Catalogue presentation and source-binding data