Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
path_._graph_theory [2014/02/09 03:18] nikolaj |
path_._graph_theory [2014/02/09 03:26] nikolaj |
||
---|---|---|---|
Line 16: | Line 16: | ||
==== Discussion ==== | ==== Discussion ==== | ||
A path is a graph which can fully be described by a sequence of vertices. | A path is a graph which can fully be described by a sequence of vertices. | ||
+ | === Theorems === | ||
+ | The only paths which are non-bipartite are cycles of odd order. | ||
==== Parents ==== | ==== Parents ==== | ||
=== Subset of === | === Subset of === |