Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Interval edge colorings of some products of graphs

Petros A. Petrosyan — 2011

Discussiones Mathematicae Graph Theory

An edge coloring of a graph G with colors 1,2,...,t is called an interval t-coloring if for each i ∈ {1,2,...,t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable, if there is an integer t ≥ 1 for which G has an interval t-coloring. Let ℜ be the set of all interval colorable graphs. In 2004 Kubale and Giaro showed that if G,H ∈ 𝔑, then the Cartesian product of these graphs...

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)