12 citations to https://www.mathnet.ru/eng/discm2
-
M. Akhmejanova, D. A. Shabanov, “Equitable Colorings of Hypergraphs with r Colors”, J Math Sci, 262:4 (2022), 391
-
Yu. A. Demidovich, “On Some Generalizations of the Property B Problem of an n-Uniform Hypergraph”, J Math Sci, 262:4 (2022), 457
-
Ian M. Wanless, David R. Wood, “A General Framework for Hypergraph Coloring”, SIAM J. Discrete Math., 36:3 (2022), 1663
-
A. E. Khuzieva, “Random Constructions of Hypergraphs with Large Girth and Without Panchromatic Colorings”, J Math Sci, 262:4 (2022), 581
-
D. D. Cherkashin, “On the Erdös–Hajnal Problem for 3-Graphs”, J Math Sci, 255:1 (2021), 103
-
Margarita Akhmejanova, Dmitry Shabanov, “Coloring hypergraphs with bounded cardinalities of edge intersections”, Discrete Mathematics, 343:4 (2020), 111692
-
A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
-
Danila Cherkashin, Fedor Petrov, “Regular Behavior of the Maximal Hypergraph Chromatic Number”, SIAM J. Discrete Math., 34:2 (2020), 1326
-
D. A. Shabanov, T. M. Shaikheeva, “The List-Chromatic Number of Complete Multipartite Hypergraphs and Multiple Covers by Independent Sets”, Math. Notes, 107:3 (2020), 499–508
-
Margarita B. Akhmejanova, Dmitry A. Shabanov, “Equitable colorings of hypergraphs with few edges”, Discrete Applied Mathematics, 276 (2020), 2