A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Interval edge-colorings of cubic graphs
[article]
2011
arXiv
pre-print
An edge-coloring of a multigraph G with colors 1,2,...,t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if G is a connected cubic multigraph (a connected cubic graph) that admits an interval t-coloring, then t≤ |V(G)| +1 (t≤ |V(G)|), where V(G) is the set of vertices of G. Moreover, if G is a connected cubic graph, G≠ K_4, and G has an interval t-coloring,
arXiv:1110.1161v1
fatcat:tpbwlrrvnrcz5cc4aucpycwnia