Assertion: graph | /r/Synonym | eulerian graph
Facets:
Source sentences:
text: A circuit that follows each edge exactly once while visiting every vertex is known as an Eulerian circuit, and the graph is called an Eulerian graph.
text: When there exists a path that traverses each edge exactly once such that the path begins and ends at the same vertex, the path is known as an Eulerian circuit, and the graph is known as an Eulerian graph.