Article ID Journal Published Year Pages File Type
4651392 Discrete Mathematics 2006 4 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On trees with a maximum proper partial 0–1 coloring containing a maximum matching
Authors
,