3 citations · 3 across the 1 of their papers we have counts for
1 paper
Maciej Kalkowski, Michał Karoński, Florian Pfender
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least…