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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134125

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0707.1926
 http://arxiv.org/abs/0707.1926
 Discrete Mathematics 306, (2006), pp. 456-459
 doi:10.1016/j.disc.2005.12.019

Collections

arXiv