Assertion: connected finite graph | /r/HasAspect | eulerian path
Facets:
Source sentences:
text: An undirected, connected graph has an Eulerian path if and only if it has either 0 or 2 vertices of odd degree.