Assertion: graph's edge | /r/HasProperty | $g$.
Facets:
Source sentences:
text: A connected graph $G$ is called an Euler graph, if there is a closed trail which includes every edge of the graph $G$.