On trees with a maximum proper partial 0-1 coloring containing a maximum matching |
| |
Authors: | V.V. Mkrtchyan |
| |
Affiliation: | 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 等数据库收录! |