Partitioning complete graphs by heterochromatic trees

Details Partitioning complete graphs by heterochromatic trees Partitioning complete graphs by heterochromatic trees

2007-11-19

arxiv.org/abs/0711.2849v1

Mathematics

Combinatorics

7 pages

Scientific paper

A {\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.

Affiliated with

Also associated with

No associations

Rating

Partitioning complete graphs by heterochromatic trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partitioning complete graphs by heterochromatic trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning complete graphs by heterochromatic trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115579