Combinatorica Package >

EulerianQ

EulerianQ[g]
yields True if graph is Eulerian, meaning there exists a tour that includes each edge exactly once.
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF