Abstract
An edge-coloring of a graph G is a coloring of the graph edges with integers such that the colors of the edges incident to any vertex of G are distinct. For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called the spectrum of that vertex in α and is denoted by
Subject
Electrical and Electronic Engineering,Atomic and Molecular Physics, and Optics
Reference9 articles.
1. West D.B. Introduction to Graph Theory. Prentice-Hall, New Jersey, 1996.
2. Caro Y., Schönheim J. Generalized 1-factorization of trees. Discrete Mathematics, 33, (1981) 319-321. https://doi.org/10.1016/0012-365X(81)90275-2
3. Kubale M. Interval vertex-coloring of a graph with forbidden colors. Discret. Math., 74, (1989) 125-136.
4. Kamalian R.R. Interval edge-colorings of graphs. Doctoral Thesis. Novosibirsk, 1990.
5. Even S., Itai A., Shamir A. On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput., 5, (1976) 691-703.