首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On trees with a maximum proper partial 0-1 coloring containing a maximum matching
Authors:VV Mkrtchyan
Institution:Department of Informatics and Applied Mathematics, Yerevan State University, Yerevan 375025, Republic of Armenia
Abstract:I prove 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.
Keywords:Partial proper 0-1 coloring  Maximum partial proper 0-1 coloring  Maximum matching
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号