Hypergraph Colorings
Hypergraph Colorings is a combinatorial assignment method in hypergraph theory that generalizes classical graph coloring by assigning colors to vertices such that no hyperedge with cardinality greater than one is monochromatic, thereby ensuring a proper coloring constraint across higher-order vertex subsets.
149
Publications
5.5K
Citations
252
Authors
162
Institutions
Publications per year
2017–2026
17
Parents
149
1–5 of 149
252
8
h-index
6
h-index
6
h-index
5
h-index
University of Illinois Urbana-Champaign, United States
5 publications · 122 citations
5
h-index
1–5 of 252
162

Hungarian Academy of Sciences
Budapest, Hungary
11 h-index
17 publications
446 citations
Charles University
Prague, Czechia
7 h-index
11 publications
212 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
12 publications
328 citations

Tel Aviv University
Tel Aviv, Israel
7 h-index
8 publications
291 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
9 publications
205 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
6 h-index
8 publications
236 citations
University of Pannonia
Veszprém, Hungary
6 h-index
12 publications
216 citations

Lomonosov Moscow State University
Moscow, Russia
5 h-index
6 publications
103 citations
1–8 of 162
12 publications · 412 citations
12
h-index
14 publications · 331 citations
12
h-index
10 publications · 233 citations
10
h-index
9 publications · 248 citations
9
h-index
9 publications · 304 citations
9
h-index
1–5