Title of article
On trees with a maximum proper partial 0–1 coloring containing a maximum matching
Author/Authors
V.V. Mkrtchyan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
4
From page
456
To page
459
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
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948197
Link To Document