30 citations to 10.1016/0095-8956(74)90059-8 (Crossref Cited-By Service)
  1. R.C Brigham, R.D Dutton, “Generalized k-tuple colorings of cycles and other graphs”, Journal of Combinatorial Theory, Series B, 32, № 1, 1982, 90  crossref
  2. Tomohiro Koana, Vincent Froese, Rolf Niedermeier, “The complexity of binary matrix completion under diameter constraints”, Journal of Computer and System Sciences, 132, 2023, 45  crossref
  3. Ranjan N. Naik, S.B. Rao, S.S. Shrikhande, N.M. Singhi, “Intersection Graphs of k-uniform Linear Hypergraphs”, European Journal of Combinatorics, 3, № 2, 1982, 159  crossref
  4. Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge, “Exploiting hidden structure in selecting dimensions that distinguish vectors”, Journal of Computer and System Sciences, 82, № 3, 2016, 521  crossref
  5. Gábor Hegedűs, “Sunflowers and -intersecting families”, AKCE International Journal of Graphs and Combinatorics, 17, № 1, 2020, 402  crossref
  6. Danila Cherkashin, Sergei Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bull Braz Math Soc, New Series, 54, № 3, 2023, 30  crossref
  7. André E. Kézdy, Hunter S. Snevily, Chi Wang, “Partitioning permutations into increasing and decreasing subsequences”, Journal of Combinatorial Theory, Series A, 73, № 2, 1996, 353  crossref
  8. H. L. Abbott, Geoffrey Exoo, “On set systems not containing delta systems”, Graphs and Combinatorics, 8, № 1, 1992, 1  crossref
  9. Matija Bucić, Stefan Glock, Benny Sudakov, “The intersection spectrum of 3‐chromatic intersecting hypergraphs”, Proceedings of London Math Soc, 124, № 5, 2022, 680  crossref
  10. Z. Füredi, I.G. Rosenberg, “Multicolored lines in a finite geometry”, Discrete Mathematics, 71, № 2, 1988, 149  crossref
Предыдущая
1
2
3
Следующая