The complete graph of vertices, or looks like this:
The number of edges in is the th triangular number. Every vertex in has degree ; therefore has an Euler circuit if and only if is odd. A complete graph always has a Hamiltonian path, and the chromatic number of is always .
|Date of creation||2013-03-22 12:16:57|
|Last modified on||2013-03-22 12:16:57|
|Last modified by||vampyr (22)|