Characterizations of various matching extensions in graphs

@article{Yu1993CharacterizationsOV,
  title={Characterizations of various matching extensions in graphs},
  author={Qinglin Yu},
  journal={Australasian J. Combinatorics},
  year={1993},
  volume={7},
  pages={55-64}
}
  • Qinglin Yu
  • Published 1993 in Australasian J. Combinatorics
Let n be a positive integer with n $; (V(O)-2)/2. A graph G is nextendable if it contains a set of n independent edges and every set of n independent edges can be extended to a perfect matching of G. In this paper, we give a characterization of n-extendable graphs. The characterizations of other matching extension are also discussed. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Matching extension and connectivity in graphs

  • M. D. Plummer
  • Congressus Numerantium, 63
  • 1988
1 Excerpt

Matching Theory

  • L. Lovasz, M. D. Plummer
  • North-Holland, Amsterdam
  • 1986
1 Excerpt

Matching extensions and products of graphs

  • M. D. Plummer
  • Annals of Discrete Math
  • 1986

and D . A . Holton , On defect - d matching in graphs

  • Q. L. Yu
  • Discrete Math .
  • 1975

Extension of partial diagonals of matrices I

  • R. A. Brualdi, H. Perfect
  • Monatsh. Math. 75
  • 1971
2 Excerpts

Similar Papers

Loading similar papers…