Assertion: graph | /r/HasProperty | eulerian
Facets:
value: like the graph
type: OTHER
Source sentences:
text: Like the graph 1 above, if a graph has way of getting from one vertex to another that includes every edge exactly once and ends at the initial vertex, then the graph is Eulerian (is a Eulerian graph).
text: Like the graph 2 above, if a graph has ways of getting from one vertex to another that include every edge exactly once and ends at another vertex than the starting one, then the graph is semi-Eulerian (is a semi-Eulerian graph).
text: This is equivalent to asking whether the graph below has a Eulerian trail, that is whether the graph is Eulerian.
text: Recall that in the previous section of "Eulerian" we saw the very simple and useful theorem about telling whether a graph is Eulerian or not.