EulerianGraphQ

EulerianGraphQ[g]

yields True if the graph g is Eulerian, and False otherwise.

Details

  • A graph is Eulerian if it has a cycle that traverses every edge exactly once.

Examples

open allclose all

Basic Examples  (2)

Test whether an undirected graph is Eulerian:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=

Not all graphs have an Eulerian cycle:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=

Scope  (5)

Applications  (3)

Properties & Relations  (7)

See Also

FindEulerianCycle  HamiltonianGraphQ  ConnectedGraphQ

Introduced in 2010
(8.0)