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

Authors

252

  1. ŹT
    Źsolt Tuza

    Hungarian Academy of Sciences, Hungary

    8 publications · 141 citations

    8

    h-index

  2. DA
    D. A. Shabanov

    Lomonosov Moscow State University, Russia

    6 publications · 93 citations

    6

    h-index

  3. CB
    Csilla Bujtás

    University of Pannonia, Hungary

    6 publications · 108 citations

    6

    h-index

  4. HL
    Hanno Lefmann

    TU Dortmund University, Germany

    5 publications · 106 citations

    5

    h-index

  5. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    5 publications · 122 citations

    5

    h-index

1–5 of 252

Venues

  1. Random Structures and Algorithms

    12 publications · 412 citations

    12

    h-index

  2. Discrete Mathematics

    14 publications · 331 citations

    12

    h-index

  3. The Electronic Journal of Combinatorics

    10 publications · 233 citations

    10

    h-index

  4. Journal of Combinatorial Theory Series B

    9 publications · 248 citations

    9

    h-index

  5. Combinatorics Probability Computing

    9 publications · 304 citations

    9

    h-index

1–5