✦ LIBER ✦

Interval edge-colorings of

✍ Scribed by Grzesik, A.; Khachatrian, H.

Book ID: 121737390
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 361 KB
Volume: 174
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Investigation on Interval Edge-Colorings

Investigation on Interval Edge-Colorings of Graphs

✍ A.S. Asratian; R.R. Kamalian 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 380 KB

An edge-coloring of a simple graph \(G\) with colors \(1,2, \ldots, t\) is called an interval \(t\)-coloring [3] if at least one edge of \(G\) is colored by color \(i, i=1, \ldots, t\) and the edges incident with each vertex \(x\) are colored by \(d_{G}(x)\) consecutive colors, where \(d_{G}(x)\) is

A generalization of interval edge-colori

A generalization of interval edge-colorings of graphs

✍ P.A. Petrosyan; H.Z. Arakelyan; V.M. Baghdasaryan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Interval edge coloring of a graph with f

Interval edge coloring of a graph with forbidden colors

✍ Marek Kubale 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 596 KB

## This paper is complementary to Kubale (1989). We consider herein a problem of interval coloring the edges of a graph under the restriction that certain colors cannot be used for some edges. We give lower and upper bounds on the minimum number of colors required for such a coloring. Since the ge

Balanced edge colorings

✍ P.N. Balister; A. Kostochka; Hao Li; R.H. Schelp 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 309 KB

Edge Colorings of Embedded Graphs

✍ Zhongde Yan; Yue Zhao 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 125 KB

Strong edge colorings of graphs

✍ Odile Favaron; Hao Li; R.H. Schelp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Let x'(G), called the strong coloring number of G, denote the minimum number of colors for which there is a proper edge coloring of a graph G in which no two of its vertices is incident to edges colored with the same set of colors. It is shown that Z'~(G) ~< Fcn], ½ < c ~ 1, whenever A(G) is appropr