Hamiltonian Circuits

Hamiltonian Circuits is a cycle in a graph that visits each vertex exactly once and returns to the starting vertex.

199

Publications

16K

Citations

357

Authors

228

Institutions

Publications per year

2017–2026

23

Authors

357

  1. LH
    Lih‐Hsing Hsu

    National Yang Ming Chiao Tung University, Taiwan

    5 publications · 168 citations

    5

    h-index

  2. JF
    Jung‐Sheng Fu

    National United University, Taiwan

    5 publications · 170 citations

    5

    h-index

  3. JJ
    Jimmy J.M. Tan

    National Yang Ming Chiao Tung University, Taiwan

    4 publications · 157 citations

    4

    h-index

  4. CG
    Craig Gidney

    Google (United States), United States

    3 publications · 659 citations

    3

    h-index

  5. PE
    P. Erdös

    Hungarian Academy of Sciences, Hungary

    3 publications · 1.8K citations

    3

    h-index

1–5 of 357

Venues

  1. Discrete Mathematics

    20 publications · 2.5K citations

    16

    h-index

  2. Information Processing Letters

    15 publications · 679 citations

    13

    h-index

  3. Journal of Combinatorial Theory Series B

    15 publications · 535 citations

    12

    h-index

  4. Journal of Graph Theory

    10 publications · 252 citations

    10

    h-index

  5. Discrete Applied Mathematics

    9 publications · 289 citations

    9

    h-index

1–5