Interval Edge Colorings of Mobius Ladders

Details Interval Edge Colorings of Mobius Ladders Interval Edge Colorings of Mobius Ladders

2007-12-31

arxiv.org/abs/0801.0159v1

Proceedings of the CSIT Conference, Yerevan, 2005, 146-149

Computer Science

Discrete Mathematics

5 pages (in Russian)

Scientific paper

An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(x) is the degree of the vertex x in G. For Mobius ladders the existence of this coloring is proved and all possible numbers of colors in such colorings are found.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234871