File talk:Labelled Eulergraph.svg
| Description |
Every vertex of this graph has an even degree, therefore this is an Eulerian graph. Following the edges in alphabetical order gives an Eularian cycle. |
|---|---|
| Source |
self-made |
| Date | |
| Author |
S Sepp |
| Permission (Reusing this file) |
See below.
|
It is stated in the description of that image that each vertex in the graph has an even degree. But is it just me or does the vertex at the bottom, to which 2 edges are connected instead of 3 have a degree of 2 instead of 3, making the description false? ¨¨¨¨Ciril
