hasEulerianCircuitConditionUndirected
P134432
predicate
Indicates that an undirected graph satisfies the necessary and sufficient conditions to contain an Eulerian circuit (typically being connected and having all vertices of even degree).
Sample triples (1)
| Subject | Object |
|---|---|
| Eulerian trail | all vertices with nonzero degree have even degree and lie in a single connected component ⓘ |