Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori

Details Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori

2007-12-26

arxiv.org/abs/0712.4148v2

Proceedings of the CSIT Conference, Yerevan, 2007, 86-88

Computer Science

Discrete Mathematics

3 pages

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 v are colored by d_{G}(v) consecutive colors, where d_{G}(v) is the degree of the vertex v in G. In this paper interval edge colorings of bipartite cylinders and bipartite tori are investigated.

Affiliated with

Also associated with

No associations

Rating

Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori 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 Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200708