Combinatorial Enumeration

Combinatorial Enumeration is the branch of combinatorics concerned with counting the number of distinct configurations in a discrete structure according to prescribed rules or constraints.

2.6K

Publications

112.6K

Citations

3.3K

Authors

1.2K

Institutions

Publications per year

2017–2026

207

Authors

3.3K

  1. FH
    Frank Harary

    University of Michigan, United States

    20 publications · 743 citations

    16

    h-index

  2. TM
    Toufik Mansour

    University of Haifa, Israel

    25 publications · 580 citations

    15

    h-index

  3. LC
    L. Carlitz

    Duke University, United States

    18 publications · 534 citations

    15

    h-index

  4. NA
    Noga Alon

    Tel Aviv University, Israel

    15 publications · 1.1K citations

    14

    h-index

  5. BD
    Brendan D. McKay

    Australian National University, Australia

    15 publications · 834 citations

    14

    h-index

1–5 of 3.3K

Venues

  1. Discrete Mathematics

    182 publications · 8K citations

    46

    h-index

  2. Journal of Combinatorial Theory Series A

    121 publications · 5.7K citations

    39

    h-index

  3. The Electronic Journal of Combinatorics

    133 publications · 3.8K citations

    31

    h-index

  4. Theoretical Computer Science

    66 publications · 4.3K citations

    29

    h-index

  5. European Journal of Combinatorics

    52 publications · 1.9K citations

    25

    h-index

1–5