Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Interval Edge-Colorings of Cartesian Products of Graphs I

Petros A. PetrosyanHrant H. KhachatrianHovhannes G. Tananyan — 2013

Discussiones Mathematicae Graph Theory

A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used and the colors of edges incident to each vertex of G form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. Let [...] be the set of all interval colorable graphs. For a graph G ∈ [...] , the least and the greatest values of t for which G has an interval t-coloring are denoted by w(G) and W(G), respectively. In this paper...

Page 1

Download Results (CSV)