A generalization of heterochromatic graphs

Details A generalization of heterochromatic graphs A generalization of heterochromatic graphs

2011-02-23

arxiv.org/abs/1102.4802v1

Mathematics

Combinatorics

14 pages, 4 figures

Scientific paper

In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. In this paper, we propose $f$-chromatic graphs as a generalization of heterochromatic graphs. An edge-colored graph is $f$-chromatic if each color $c$ appears on at most $f(c)$ edges. We also present a necessary and sufficient condition for edge-colored graphs to have an $f$-chromatic spanning forest with exactly $m$ components. Moreover, using this criterion, we show that a $g$-chromatic graph $G$ of order $n$ with $|E(G)|>\binom{n-m}{2}$ has an $f$-chromatic spanning forest with exactly $m$ ($1 \le m \le n-1$) components if $g(c) \le \frac{|E(G)|}{n-m}f(c)$ for any color $c$.

Affiliated with

Also associated with

No associations

Rating

A generalization of heterochromatic graphs 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 A generalization of heterochromatic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A generalization of heterochromatic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175323