has an even number of vertices
* 2-regular
* 2-vertex colorable, if and only if it has an even number of vertices. More generally, a graph is bipartite if and only if it has no odd cycles (Konig, 1936).
* Connected
* Eulerian
* Hamiltonian
*