hasEulerianCircuitConditionDirected
P134433
predicate
Indicates that a directed graph satisfies the necessary and sufficient conditions for having an Eulerian circuit (a closed walk using every directed edge exactly once).
Sample triples (1)
| Subject | Object |
|---|---|
| Eulerian trail | in-degree equals out-degree for every vertex and all vertices with nonzero degree lie in a single strongly connected component of the underlying graph ⓘ |