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
Parents
32
$$F$$ F -Factors in Hypergraphs Via Absorption
Allan Lo, Klas Markström · Graphs and Combinatorics · 2014 · 83 citations
1–5 of 32
62
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 62
54

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
39 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
40 citations
University of Chicago
Chicago, United States
2 h-index
4 publications
96 citations

University of Birmingham
Birmingham, United Kingdom
2 h-index
2 publications
97 citations

University of Manitoba
Winnipeg, Canada
2 h-index
2 publications
38 citations

University of Warmia and Mazury in Olsztyn
Olsztyn, Poland
1 h-index
1 publications
22 citations
National Research Council Canada
Ottawa, Canada
1 h-index
1 publications
10 citations
University of Oregon
Eugene, United States
1 h-index
1 publications
46 citations
1–8 of 54
3 publications · 48 citations
3
h-index
2 publications · 33 citations
2
h-index
2 publications · 98 citations
2
h-index
2 publications · 25 citations
2
h-index
2 publications · 43 citations
2
h-index
1–5