EulerianQ

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

EulerianQ[g]
yields True if graph g is Eulerian, meaning there exists a tour that includes each edge exactly once.

DetailsDetails

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

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

EulerianQ has been superseded by EulerianGraphQ:

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