Partitioning complete graphs by heterochromatic trees

Simple item page
dc.creatorJin, Zemin
dc.creatorLi, Xueliang
dc.date2007-11-19
dc.date.accessioned2026-07-07T08:43:41Z
dc.date.available2026-07-07T08:43:41Z
dc.descriptionA {\it heterochromatic tree} is an edge-colored tree in which any two edges have different colors. The {\it heterochromatic tree partition number} of an $r$-edge-colored graph $G$, denoted by $t_r(G)$, is the minimum positive integer $p$ such that whenever the edges of the graph $G$ are colored with $r$ colors, the vertices of $G$ can be covered by at most $p$ vertex-disjoint heterochromatic trees. In this paper we determine the heterochromatic tree partition number of an $r$-edge-colored complete graph.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0711.2849
dc.identifierhttp://arxiv.org/abs/0711.2849
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142403
dc.subjectCombinatorics
dc.subject05C05; 05C15; 05C70
dc.titlePartitioning complete graphs by heterochromatic trees
dc.typetext

Files

Collections

arXiv