On trees with a maximum proper partial 0-1 coloring containing a maximum matching - Computer Science > Discrete MathematicsReportar como inadecuado




On trees with a maximum proper partial 0-1 coloring containing a maximum matching - Computer Science > Discrete Mathematics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: I prove that in a tree in which the distance between any two endpoints iseven, there is a maximum proper partial 0-1 coloring such that the edgescolored by 0 form a maximum matching.



Autor: V. V. Mkrtchyan

Fuente: https://arxiv.org/







Documentos relacionados