🎴 Flashcard Mode
Eulerian and Hamiltonian Graphs
Card1 / 15
Mastered0
Review0
QuestionClick to flip
In a connected graph, an Eulerian path is a path that:
AnswerClick to flip back
A
Visits every edge exactly once
💡 Explanation:
An Eulerian path is a path that visits every edge of a graph exactly once. It is not necessary for the path to visit every vertex of the graph.