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

Authors

151

  1. MS
    Michael S. Waterman

    University of Southern California, United States

    3 publications · 1.5K citations

    3

    h-index

  2. SE
    S. E. Goodman

    University of Arizona, United States

    2 publications · 59 citations

    2

    h-index

  3. DP
    Dominik Pająk

    Wrocław University of Science and Technology, Poland

    2 publications · 28 citations

    2

    h-index

  4. RW
    Robin Wilson

    The Open University, United Kingdom

    2 publications · 117 citations

    2

    h-index

  5. OS
    Ola Svensson

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 129 citations

    2

    h-index

1–5 of 151

Venues

  1. Discrete Mathematics

    8 publications · 177 citations

    8

    h-index

  2. Discrete Applied Mathematics

    5 publications · 120 citations

    5

    h-index

  3. European Journal of Combinatorics

    3 publications · 42 citations

    3

    h-index

  4. SIAM Journal on Discrete Mathematics

    2 publications · 38 citations

    2

    h-index

  5. Networks

    2 publications · 27 citations

    2

    h-index

1–5