On trees with a maximum proper partial 0-1 coloring containing a maximum matching

Details On trees with a maximum proper partial 0-1 coloring containing a maximum matching On trees with a maximum proper partial 0-1 coloring containing a maximum matching

2007-07-13

arxiv.org/abs/0707.1926v1

Discrete Mathematics 306, (2006), pp. 456-459

Computer Science

Discrete Mathematics

4 pages

Scientific paper

10.1016/j.disc.2005.12.019

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.

Affiliated with

Also associated with

No associations

Rating

On trees with a maximum proper partial 0-1 coloring containing a maximum matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On trees with a maximum proper partial 0-1 coloring containing a maximum matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On trees with a maximum proper partial 0-1 coloring containing a maximum matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60100