On Trees with a Special Proper Partial 0-1 Colorings

Authors

  • Vahan V. Mkrtchyan Yerevan State University

Abstract

It is proved that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0¡1 coloring such that the edges colored by 0 form a maximum matching.

 

References

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

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

Downloads

Published

2021-12-10

How to Cite

Mkrtchyan, V. V. (2021). On Trees with a Special Proper Partial 0-1 Colorings. Mathematical Problems of Computer Science, 24, 82–85. Retrieved from http://93.187.165.2/index.php/mpcs/article/view/580

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.