Eulerian path
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. The problem can be stated mathematically like this: Given the graph in the image, is it possible to construct a path (or a cycle, i.e. a path starting and ending on the same vertex) which visits each edge exactly once?
Euler's circuitEuler circuitEuler circutEuler cycleEuler graphEuler pathEuler tourEuler trailEuler walkEulerian circuitEulerian cycleEulerian graphEulerian graphsEulerian orientationEulerian tourEulerian trailEulerian walkFleury's algorithmFleury algorithmHierholzer's algorithmKotzig transformationsList of impossible figures to redrawSemi-EulerianSemi-Eulerian graphTraversable graphUnicursal graph
Wikipage redirect
primaryTopic
Eulerian path
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. The problem can be stated mathematically like this: Given the graph in the image, is it possible to construct a path (or a cycle, i.e. a path starting and ending on the same vertex) which visits each edge exactly once?
has abstract
Ein Eulerkreis oder (geschloss ...... kein Knoten wiederholen darf.
@de
En la teoría de grafos, un cam ...... de los puentes de Königsberg.
@es
En théorie des graphes, on dit ...... t tracer sans lever le crayon.
@fr
In graph theory, an Eulerian t ...... rcuit is called semi-Eulerian.
@en
In teoria dei grafi la nozione ...... sono detti circuiti euleriani.
@it
Um Caminho Euleriano é um cami ...... assar uma vez em cada vértice.
@pt
Łańcuch Eulera (droga Eulera, ...... i wychodzących różni się o 1.
@pl
Эйлеров путь (эйлерова цепь) в ...... граф, содержащий эйлеров путь.
@ru
في نظرية المخططات، مسار اويلري ...... جسور كونيغسبرغ السبعة الشهيرة.
@ar
オイラー路（オイラーろ、英: Eulerian trail） ...... でないオイラー路を持つグラフのことを準オイラーグラフという。
@ja
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
740,872,381
subject
hypernym
type
comment
Ein Eulerkreis oder (geschloss ...... hn einen semieulerschen Graph.
@de
En la teoría de grafos, un cam ...... de los puentes de Königsberg.
@es
En théorie des graphes, on dit ...... 'ordre succède à la dernière).
@fr
In graph theory, an Eulerian t ...... visits each edge exactly once?
@en
In teoria dei grafi la nozione ...... particolari dei multidigrafi.
@it
Um Caminho Euleriano é um cami ...... assar uma vez em cada vértice.
@pt
Łańcuch Eulera (droga Eulera, ...... związaną z drogami w grafach.
@pl
Эйлеров путь (эйлерова цепь) в ...... граф, содержащий эйлеров путь.
@ru
في نظرية المخططات، مسار اويلري ...... جسور كونيغسبرغ السبعة الشهيرة.
@ar
オイラー路（オイラーろ、英: Eulerian trail） ...... でないオイラー路を持つグラフのことを準オイラーグラフという。
@ja
label
Caminho euleriano
@pt
Cammino euleriano
@it
Ciclo euleriano
@es
Eulerian path
@en
Eulerkreisproblem
@de
Graphe eulérien
@fr
Łańcuch Eulera
@pl
Эйлеров цикл
@ru
دارة أويلرية
@ar
オイラー路
@ja
