✦ LIBER ✦

A generalization of interval edge-colorings of graphs

✍ Scribed by P.A. Petrosyan; H.Z. Arakelyan; V.M. Baghdasaryan

Book ID: 108112888
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 428 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.06.012

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

Interval edge-colorings of

✍ Grzesik, A.; Khachatrian, H. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 361 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

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

Acyclic edge colorings of graphs

✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_