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

Simple item page
dc.creatorMkrtchyan, V. V.
dc.date2007-07-13
dc.date.accessioned2026-07-07T08:17:32Z
dc.date.available2026-07-07T08:17:32Z
dc.descriptionI 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.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0707.1926
dc.identifierhttp://arxiv.org/abs/0707.1926
dc.identifierDiscrete Mathematics 306, (2006), pp. 456-459
dc.identifierdoi:10.1016/j.disc.2005.12.019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134125
dc.subjectDiscrete Mathematics
dc.titleOn trees with a maximum proper partial 0-1 coloring containing a maximum matching
dc.typetext

Files

Collections

arXiv