A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian
graphs on 
, 2, ... nodes
are 0, 1, 2, 8, 27, 141, 992, 12110, 272650, ..., obtained by subtracting the Eulerian graph counts from the total graph
counts (OEIS A000088 and A133736).
The corresponding numbers of simple noneulerian connected
graphs are 0, 1, 1, 5, 17, 104, 816, 10933, 259298, ... (OEIS A158007).
Any graph with a vertex of odd vertex degree or a bridge is noneulerian.
