Eulerian Paths
Eulerian Paths is a concept in graph theory that denotes a trail in a graph which visits every edge exactly once, distinguished from other trails by its exhaustive traversal of edges without repetition.
70
Publications
3.9K
Citations
151
Authors
91
Institutions
Publications per year
2017–2026
8
Variants
Eulerian TrailEulerian Trails
Parents
70
Synchronizing finite automata on Eulerian digraphs
Jarkko Kari · Theoretical Computer Science · 2003 · 131 citations
Geometric Optics in a Phase-Space-Based Level Set and Eulerian Framework
Stanley Osher, Li‐Tien Cheng, Myungjoo Kang et al. · Journal of Computational Physics · 2002 · 125 citations
1–5 of 70
151
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 151
91
University of Southern California
Los Angeles, United States
4 h-index
8 publications
4.4K citations
Xinjiang University
Ürümqi, China
3 h-index
5 publications
80 citations
Commissariat à l'Énergie Atomique et aux Énergies Alternatives
Paris, France
2 h-index
3 publications
494 citations

Northeastern University
Shenyang, China
2 h-index
6 publications
126 citations

University of Ljubljana
Ljubljana, Slovenia
2 h-index
3 publications
57 citations

University of Kragujevac
Kragujevac, Serbia
2 h-index
2 publications
106 citations
Institut de Physique Théorique
Gif-sur-Yvette, France
2 h-index
3 publications
494 citations

University of Auckland
Auckland, New Zealand
2 h-index
3 publications
57 citations
1–8 of 91
8 publications · 177 citations
8
h-index
5 publications · 120 citations
5
h-index
3 publications · 42 citations
3
h-index
2 publications · 38 citations
2
h-index
2 publications · 27 citations
2
h-index
1–5