All Questions
Tagged with eulerian-path proof-explanation
3
questions
0
votes
1
answer
57
views
Eulerian Trail proof in Walk Through Combinatorics
I'm struggling with the proof of Eulerian trail in walk through combinatorics.
As you now, the theorem states that "A connected graph G has a closed Eulerian trail if and only if all vertices of ...
- 73
0
votes
1
answer
54
views
"If a vertex appears $k$ times in an eulerian circuit, then it must have degree $2k$" - Why?
I need help understanding this part of this proof from Graphs and Digraphs (7th ed):
Theorem 3.1. A connected multigraph is eulerian if and only if every vertex has
even degree.
The authors of this ...
- 927
0
votes
1
answer
161
views
Graph theory cycle problems
Question background: In each of the pictures below; there are line segments connecting black dots (7 line segments in the left picture and 12 line segments in the right picture).
Question asks to ...
- 125