is_eulerian¶

is_eulerian(G)[source]¶

Return True if G is an Eulerian graph, False otherwise.

An Eulerian graph is a graph with an Eulerian circuit.

Parameters:	G (graph) – A NetworkX Graph

Examples

>>> nx.is_eulerian(nx.DiGraph({0:[3], 1:[2], 2:[3], 3:[0, 1]}))
True
>>> nx.is_eulerian(nx.complete_graph(5))
True
>>> nx.is_eulerian(nx.petersen_graph())
False

Notes

This implementation requires the graph to be connected (or strongly connected for directed graphs).