✦ LIBER ✦

r-Strong edge colorings of graphs

✍ Scribed by S. Akbari; H. Bidkhori; N. Nosrati

Book ID: 108113530
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 196 KB
Volume: 306
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.12.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adjacent strong edge colorings and total

Adjacent strong edge colorings and total colorings of regular graphs

✍ ZhongFu Zhang; Douglas R. Woodall; Bing Yao; JingWen Li; XiangEn Chen; Liang Bia 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 201 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

Incidence and strong edge colorings of g

Incidence and strong edge colorings of graphs

✍ Richard A. Brualdi; Jennifer J. Quinn Massey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 485 KB

We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. We improve a bound for the strong chromatic index of bipartite graphs all of whose cycle lengths

Parity and strong parity edge-colorings

Parity and strong parity edge-colorings of graphs

✍ Hsiang-Chun Hsu, Gerard J. Chang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 430 KB

Adjacent strong edge coloring of graphs

✍ Zhongfu Zhang; Linzhong Liu; Jianfang Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For a graph G(V, E), if a proper k-edge coloring f is satisfied with C(u) # C(V) for UZ) E E(G), where C(u) = {f(~v) 1 UZI E E}, then f is called k-adjacent strong edge coloring of G. is abbreviated k-ASEC, and xbs(G) = min{k 1 k-ASEC of G} is called the adjacent strong edge chromatic number of G. I

Edge Colorings of Embedded Graphs

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