|
[1] Liu G, Yu Q. Generalization of matching extensions in graphs. Discrete Math, 2001, 231: 311--320
[2] Bondy J A, Murty U S R. Graph Theory with Applications. New York: American Elsevier, 1976
[3] Lovász L, Plummer M D. Matching Theory. New York: North-Holland, 1986
[4] Berge C. Sur le couplage maximum d'un graphe. C R Acad Sci Paris, 1958, 247: 258--259
[5] Favaron O. On n-factor-critical graphs. Discuss Math Graph Theory, 1996, 16: 41--51
[6] Yu Q. Characterizations of various matchings in graphs. Australsa J Combin, 1993, 7: 55--64
[7] Plummer M D. On $n$-extendable graphs. Discrete Math, 1980, 31: 201--210
[8] Lou D. Some conditions for $k$-extendable graph. Australas J Combin, 1994, 9: 123--136
[9] Lou D, Holton D A. Lower bounds of cyclic edge connectivity for n-extendability of regular graphs. Discrete Math, 1993, 112: 139--150
[10] Plummer M D. Extending matchings in planar graphs IV. Discrete Math, 1992, 109: 207--219
[11] Plummer M D. Extending matchings in graphs: a survey. Discrete Math, 1994, 127: 277--292
[12] Plummer M D. Extending matchings in graphs: an update. Congr Numer, 1996, 116: 3--32
[13] Györi E, Plummer M D. The Cartesian product of a k-extendable and an m-extendable graph is (k+m+1)-extendable. Discrete Math, 1992, 101: 87--96
[14] Yu Q. A note on n-extendable graphs. J Graph Theory, 1992, 16: 349--353
[15] de Carvalho M H, Lucchesi C L, Murty U S R. Ear decompositions of matching covered graphs. Combinatorica, 1999, 19: 151--174
[16] de Carvalho M H, Lucchesi C L, Murty U S R. Optimal ear decompositions of 1-extendable graphs and bases for the matching lattice. J Combin Theory Ser B, 2002, 85: 59--93
[17] de Carvalho M H, Lucchesi C L, Murty U S R. On a conjecture of Lov\'{a}sz concerning bricks, I. The characteristic of 1-extendable graph. J Combin Theory Ser B, 2002, 85: 94--136
[18] de Carvalho M H, Lucchesi C L, Murty U S R. On a conjecture of Lov\'{a}sz concerning bricks, II. Bricks of finite characteristic. J Combin Theory Ser B, 2002, 85: 137--180
[19] Lov\'{a}sz L. Matching structure and the matching lattice. J Combin Theory Ser B, 1987, 43: 187--222
[20] Murty U S R. The Matching Lattice and Related Topics, Preliminary Report. Waterloo (Canada): University of Waterloo, 1994
[21] Jin Z, Yan H, Yu Q. Generalization of matching extension in graphs (II). Submitted
[22] Chen C. Binging number and toughness for matching extension. Discrete Math, 1995, 146: 303--306
|