Hamiltonian Graphs

A Hamiltonian Graph is a graph that contains a Hamiltonian cycle, defined as a cycle passing through each vertex exactly once, forming a closed loop that visits all vertices without repetition.

834

Publications

31.8K

Citations

1.1K

Authors

579

Institutions

Publications per year

2017–2026

50

Authors

1.1K

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    24 publications · 706 citations

    18

    h-index

  2. RJ
    Ronald J. Gould

    Emory University, United States

    20 publications · 725 citations

    15

    h-index

  3. HB
    Hajo Broersma

    University of Twente, Netherlands

    19 publications · 548 citations

    15

    h-index

  4. LH
    Lih‐Hsing Hsu

    National Yang Ming Chiao Tung University, Taiwan

    19 publications · 612 citations

    14

    h-index

  5. ZR
    Zdeněk Ryjáček

    University of West Bohemia in Pilsen, Czechia

    16 publications · 353 citations

    13

    h-index

1–5 of 1.1K

Venues

  1. Discrete Mathematics

    123 publications · 3.9K citations

    32

    h-index

  2. Journal of Graph Theory

    124 publications · 4K citations

    31

    h-index

  3. Journal of Combinatorial Theory Series B

    67 publications · 2.7K citations

    31

    h-index

  4. Information Processing Letters

    27 publications · 1.1K citations

    17

    h-index

  5. SIAM Journal on Discrete Mathematics

    23 publications · 629 citations

    17

    h-index

1–5