Homogeneous Edge-Colorings of Graphs

Details Homogeneous Edge-Colorings of Graphs Homogeneous Edge-Colorings of Graphs

2012-03-20

arxiv.org/abs/1203.4531v1

Mathematics

Combinatorics

Scientific paper

Let G = (V, E) be a multigraph without loops and for any x {\in}V let E(x) be the set of edges of G incident to x. A homogeneous edge-coloring of G is an assignment of an integer m >= 2 and a coloring c:E {\to} S of the edges of Gsuchthat|S| = mandforanyx{\in}V,if|E(x)| = mqx+rx with0 <= rx

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496628