Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02692626n
Noun Concept
Categories: Graph theory objects, Leonhard Euler
EN
Eulerian path  Euler's circuit  Euler circuit  Euler circuits  Euler circut
EN
In graph theory, an Eulerian trail is a trail in a finite graph that visits every edge exactly once. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, an Eulerian trail is a trail in a finite graph that visits every edge exactly once. Wikipedia
A sequential set of edges within a graph that reach all nodes Wikipedia Disambiguation
Trail in a finite graph which visits every edge exactly once Wikidata
IS A
concept
path
trail
HAS KIND
Eulerian cycle
DISCOVERER OR INVENTOR
Euler
NAMED AFTER
Euler
STUDIED BY
graph theory
Wikipedia
EN
Eulerian path
Wikidata
EN
Eulerian path
Wikipedia Redirections
EN
Euler's circuit, Euler circuit, Euler circuits, Euler circut, Euler cycle, Euler graph, Euler path, Euler tour, Euler trail, Euler walk, Eulerian circuit, Eulerian cycle, Eulerian graph, eulerian graphs, Eulerian orientation, Eulerian tour, Eulerian trail, Eulerian walk, Fleury's algorithm, Fleury algorithm, Hierholzer's algorithm, Kotzig transformations, List of impossible figures to redraw, Semi-Eulerian, Semi-Eulerian graph, Traversable graph, Unicursal graph
Wikidata Alias
EN
Eulerian trail

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License