139 citations to 10.1016/0097-3165(77)90009-7 (Crossref Cited-By Service)
  1. Konstantin Golubev, “On the chromatic number of a simplicial complex”, Combinatorica, 37, № 5, 2017, 953  crossref
  2. Janos Barta, Roberto Montemanni, Derek H. Smith, 2014 2nd International Conference on Information and Communication Technology (ICoICT), 2014, 187  crossref
  3. Lingfei Jin, “A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound”, IEEE Trans. Inform. Theory, 62, № 1, 2016, 159  crossref
  4. Sophie Huczynska, “Powerline communication and the 36 officers problem”, Phil. Trans. R. Soc. A., 364, № 1849, 2006, 3199  crossref
  5. Yeow Meng Chee, Van Khu Vu, 2014 IEEE International Symposium on Information Theory, 2014, 2959  crossref
  6. Cheng Yeaw Ku, Benjamin B. McMillan, “Independent sets of maximal size in tensor powers of vertex‐transitive graphs”, Journal of Graph Theory, 60, № 4, 2009, 295  crossref
  7. Cheng Yeaw Ku, David B. Wales, “Eigenvalues of the derangement graph”, Journal of Combinatorial Theory, Series A, 117, № 3, 2010, 289  crossref
  8. Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan, “Tree representations of graphs”, European Journal of Combinatorics, 28, № 4, 2007, 1087  crossref
  9. Chris Godsil, Karen Meagher, “A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations”, European Journal of Combinatorics, 30, № 2, 2009, 404  crossref
  10. M. Deza, 6, Combinatorial Mathematics, Optimal Designs and Their Applications, 1980, 41  crossref
Предыдущая
1
2
3
4
5
6
7
8
14
Следующая