Enumerative Graph Theory

Enumerative Graph Theory is a branch of graph theory that focuses on the exact counting of graphs or graph properties, distinguished by its use of combinatorial methods to systematically enumerate graph structures according to specified criteria.

1.1K

Publications

42.7K

Citations

1.7K

Authors

800

Institutions

Publications per year

2017–2026

114

Authors

1.7K

  1. FH
    Frank Harary

    University of Michigan, United States

    13 publications · 341 citations

    12

    h-index

  2. SK
    Sandi Klavžar

    University of Maribor, Slovenia

    10 publications · 570 citations

    10

    h-index

  3. LV
    Lutz Volkmann

    RWTH Aachen University, Germany

    10 publications · 217 citations

    10

    h-index

  4. DM
    Dragan Marušič

    University of Ljubljana, Slovenia

    9 publications · 470 citations

    9

    h-index

  5. NW
    Nicholas Wormald

    The University of Melbourne, Australia

    8 publications · 603 citations

    8

    h-index

1–5 of 1.7K

Venues

  1. Discrete Mathematics

    167 publications · 4.4K citations

    33

    h-index

  2. Journal of Combinatorial Theory Series B

    69 publications · 2.8K citations

    32

    h-index

  3. Journal of Graph Theory

    78 publications · 2.6K citations

    29

    h-index

  4. Discrete Applied Mathematics

    65 publications · 2.2K citations

    24

    h-index

  5. The Electronic Journal of Combinatorics

    33 publications · 1.1K citations

    20

    h-index

1–5