English

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

Discrete Mathematics 2007-07-16 v1

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.

Cite

@article{arxiv.0707.1926,
  title  = {On trees with a maximum proper partial 0-1 coloring containing a maximum matching},
  author = {V. V. Mkrtchyan},
  journal= {arXiv preprint arXiv:0707.1926},
  year   = {2007}
}

Comments

4 pages

R2 v1 2026-06-21T08:57:51.898Z