A Note on Matching Covered Graphs

Authors

  • Vahan V . Mkrtchyan Yerevan State University

Abstract

A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that line-extremal matching covered graphs contain a perfect matching.

References

Harary F., Graph Theory, Addison-Wesley, Reading, MA , 1969.

Lovasz L., Plummer M.D ., Matching Theory, Annals of Discrete Math. 29, North Holland, 1986.

West D . B., Introduction to Graph Theory, Prentice-Hall, Inc.,1996

Downloads

Published

2021-12-10

How to Cite

Mkrtchyan, V. V. . . (2021). A Note on Matching Covered Graphs. Mathematical Problems of Computer Science, 24, 104–106. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/592

Issue

Vol. 24 (2005): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.