On the upper bounds of the numbers of perfect matchings in graphs with given parameters

Acta Mathematicae Applicatae Sinica

Volumn 23, Issue 1, 2007, Pages 155-160

  Lin, Hong ^a   Guo, Xiao Feng ^a  

^a XIAMEN UNIVERSITY   (China)

Author keywords

Chromatic number; Clique number; Connectivity; Diameter; Perfect matching

Indexed keywords

EID: 33845766647     PISSN: 01689673     EISSN: 16183932     Source Type: Journal    
DOI: 10.1007/s10255-006-0360-1     Document Type: Article

References (5)

1. Bollobás, B. Extremal graph theory. Academic Press, London, New York, San Francisco, 1978
2. Bollobás, B. Modern graph theory. Springer-Verlag, New York, 1998
3. Bondy, J.A., Murty, U.S.R. Graph theory with applications. MaCMillan Press, London, 1976
4. Lovász, L., Plumper, M.D. Matching theory. North Holland, Amsterdam, 1986
5. Ore, O. Diameters in graphs. J. Combinatorial Theory (Series B), 5: 75-81 (1968)