Abstract
An edge-coloring of a graph with colors is an interval -coloring if all colors are used, and the colors of edges incident to each vertex of are distinct and form an interval of integers. A graph is interval colorable if has an interval -coloring for some positive integer . Let be the set of all interval colorable graphs. For a graph , the least and the greatest values of for which has an interval -coloring are denoted by and , respectively. In this paper we first show that if is an -regular graph and , then () and (). Next, we investigate interval edge-colorings of grids, cylinders and tori. In particular, we prove that if is planar and both factors have at least 3 vertices, then and . Finally, we confirm the first author's conjecture on the -dimensional cube and show that has an interval -coloring if and only if .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.