Hypergraph Isomorphism

Hypergraph Isomorphism is a bijective mapping between the vertex sets of two hypergraphs that preserves both the cardinality of the edge sets and the incidence structure among vertices and hyperedges, thereby establishing a structural equivalence between the hypergraphs.

32

Publications

674

Citations

62

Authors

54

Institutions

Publications per year

2017–2026

5

Authors

62

  1. WL
    William L. Kocay

    University of Manitoba, Canada

    2 publications · 38 citations

    2

    h-index

  2. PC
    Paolo Codenotti

    University of Chicago, United States

    2 publications · 48 citations

    2

    h-index

  3. LB
    László Babai

    University of Chicago, United States

    2 publications · 48 citations

    2

    h-index

  4. YV
    Yu. V. Muranov

    Bielefeld University, Germany

    1 publications · 22 citations

    1

    h-index

  5. CB
    C. Berge

    Centre de Gestion Scientifique, France

    1 publications · 20 citations

    1

    h-index

1–5 of 62

Venues

  1. Journal of Graph Theory

    3 publications · 48 citations

    3

    h-index

  2. The Electronic Journal of Combinatorics

    2 publications · 33 citations

    2

    h-index

  3. Graphs and Combinatorics

    2 publications · 98 citations

    2

    h-index

  4. Fuzzy Sets and Systems

    2 publications · 25 citations

    2

    h-index

  5. Journal of Combinatorial Theory Series B

    2 publications · 43 citations

    2

    h-index

1–5