Category:Characteristics of Traversable Graph
Jump to navigation
Jump to search
This category contains pages concerning Characteristics of Traversable Graph:
A finite loop-multigraph is traversable if and only if it is connected and no more than two vertices are odd.
An Eulerian trail which is not an Eulerian circuit must start and end at an odd vertex.
Pages in category "Characteristics of Traversable Graph"
This category contains only the following page.