On two equimatchable graph classes

Discrete Mathematics

Volumn 266, Issue 1-3, 2003, Pages 263-274

  Kawarabayashi, Ken Ichi ^a   Plummer, Michael D ^b   Saito, Akira ^c  

^a KEIO UNIVERSITY   (Japan)

^b VANDERBILT UNIVERSITY   (United States)

^c NIHON UNIVERSITY   (Japan)

Author keywords

Equimatchable; Factor critical; Matching; Randomly matchable

Indexed keywords

EID: 84867966387     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00813-0     Document Type: Conference Paper

References (9)

1. O. Favaron Equimatchable factor-critical graphs J. Graph Theory 10 1986 439 448
2. H. Lebesgue Quelques conséquences simples de la formule d'Euler J. de Math. 9 1940 27 43
3. M. Lesk, M.D. Plummer, W.R. Pulleyblank, Equi-matchable graphs, Graph Theory and Combinatorics, Academic Press, London, 1984, pp. 239-254.
4. M. Lewin Matching-perfect and cover-perfect graphs Israel J. Math. 18 1974 345 347
5. L. Lovász, and M.D. Plummer Matching Theory Annals of Discrete Mathematics Vol. 29 1986 North-Holland Amsterdam
6. D.H.-C. Meng, Matchings and coverings for graphs, Ph.D. Thesis, Michigan State University, East Lansing, MI, 1974.
7. O. Ore, M.D. Plummer, Cyclic colorations of plane graphs, Recent progress in combinatorics, Proceedings of the Third Waterloo Conference, Academic Press, New York, 1969, pp. 287-293.
8. M.D. Plummer A theorem on matchings in the plane L.D. Andersen, I.T. Jakobsen, C. Thomassen, B. Toft, P.D. Vestergaard, Graph Theory in Memory of G.A. Dirac Annals of Discrete Mathematics Vol. 41 1989 North-Holland Amsterdam 347 354
9. D.P. Sumner Randomly matchable graphs J. Graph Theory 3 1979 183 186