Eulerian Graphs

An Eulerian Graph is a connected graph in which every vertex has even degree, distinguishing it from other connected graphs by admitting a closed trail that traverses every edge exactly once.

227

Publications

8.6K

Citations

367

Authors

216

Institutions

Publications per year

2017–2026

16

Authors

367

  1. HL
    Hong‐Jian Lai

    West Virginia University, United States

    9 publications · 200 citations

    9

    h-index

  2. HF
    Herbert Fleischner

    Austrian Academy of Sciences, Austria

    7 publications · 134 citations

    7

    h-index

  3. BJ
    Bill Jackson

    Queen Mary University of London, United Kingdom

    6 publications · 127 citations

    6

    h-index

  4. AB
    André Bouchet

    Le Mans Université, France

    5 publications · 185 citations

    5

    h-index

  5. MŠ
    Martin Škoviera

    Comenius University Bratislava, Slovakia

    4 publications · 75 citations

    4

    h-index

1–5 of 367

Venues

  1. Journal of Graph Theory

    26 publications · 1.3K citations

    18

    h-index

  2. Discrete Mathematics

    20 publications · 468 citations

    16

    h-index

  3. Journal of Combinatorial Theory Series B

    15 publications · 573 citations

    12

    h-index

  4. Discrete Applied Mathematics

    12 publications · 298 citations

    12

    h-index

  5. European Journal of Combinatorics

    7 publications · 227 citations

    7

    h-index

1–5