Ivan Shishkin, Rye (1878)

Problems/Discrete mathematicsReviewed

Eulerian path in a finite graph

by Sequoia·
24
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 1–10First steps / middle schoolPremiers pas / collège
  2. 11–25Beginner / high schoolDébutant / lycée
  3. 26–50Intermediate / undergraduateIntermédiaire / licence
  4. 51–70Advanced / graduateAvancé / master
  5. 71–90Expert / specializedExpert / spécialisé
  6. 91–100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
EnglishFrançais

Let G=(V,E)G=(V,E) be a finite connected graph. Define an eulerian path as a sequence of edges that visits every edge of EE exactly once.

Picture6
Following 1,2,3,4,5,6,7 traverses the graph, visiting every edge once. This is an eulerian path.

What condition on GG ensures the existence of an eulerian path ?

I solved itMark it doneAdd to my listKeep it in your list
I like this problem0 likes
Show related problems0

No related problems yet.

Solutions

0
Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.