Author： Weifan W.
Publisher： Elsevier
ISSN： 0195-6698
Source： European Journal of Combinatorics, Vol.20, Iss.4, 1999-05, pp. : 313-315
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
Circular chromatic number of Kneser graphs
Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. :
Access to resources
Recommend
Sharp upper bounds on the spectral radius of graphs
Linear Algebra and its Applications, Vol. 377, Iss. unknown, 2004-01 ,pp. :
Upper and lower bounds for the energy of bipartite graphs
Journal of Mathematical Analysis and Applications, Vol. 289, Iss. 2, 2004-01 ,pp. :
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes
By Fleiner T. Kaibel V. Rote G.
European Journal of Combinatorics, Vol. 21, Iss. 1, 2000-01 ,pp. :