Author： Kostochka Alexandr Tashkinov Vladimir
Publisher： Springer Publishing Company
ISSN： 0167-8094
Source： Order, Vol.20, Iss.3, 2003-01, pp. : 239-253
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Shortest Paths in Distance-regular Graphs
By Bendito E. Carmona A. Encinas A.M.
European Journal of Combinatorics, Vol. 21, Iss. 2, 2000-02 ,pp. :
Access to resources
Recommend
Decomposing complete graphs into K r xK c 's
By Fu H.L. Hwang F.K. Jimbo M. Mutoh Y. Shiue C.L.
Journal of Statistical Planning and Inference, Vol. 119, Iss. 2, 2004-02 ,pp. :
On the Number of 4-Edge Paths in Graphs With Given Edge Density
Combinatorics, Probability & Computing, Vol. 26, Iss. 3, 2017-05 ,pp. :