共 50 条
- [1] On K-1,K-3-free strictly Deza graphs [J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2016, 22 (01): : 231 - 234
- [2] Supertough graphs need not he K-1,K-3-free [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 32 : 91 - 103
- [6] Every K-1,K-7 and K-1,K-3-free, 3-vertex critical graph of even order has a perfect matching [J]. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2010, 13 (06): : 583 - 591
- [7] ON THE INDEPENDENCE NUMBER IN K-1,K-R+1-FREE GRAPHS [J]. DISCRETE MATHEMATICS, 1995, 138 (1-3) : 365 - 374
- [8] Deza graphs with parameters (v,k,k-2,a) [J]. JOURNAL OF COMBINATORIAL DESIGNS, 2020, 28 (09) : 658 - 669
- [9] On K1,3-Free Strictly Deza Graphs [J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2017, 297 : S159 - S162
- [10] ON UNIFORMLY RESOLVABLE {K-1,K-2, K-1,K-3}-DESIGNS [J]. ATTI ACCADEMIA PELORITANA DEI PERICOLANTI-CLASSE DI SCIENZE FISICHE MATEMATICHE E NATURALI, 2018, 96 : A91 - A97