On trees with a maximum proper partial 0-1 coloring containing a maximum matching
arXiv:0707.1926 · doi:10.1016/j.disc.2005.12.019
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.
4 pages