𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong edge-coloring of planar graphs

✍ Scribed by Hudák, Dávid; Lužar, Borut; Soták, Roman; Škrekovski, Riste

Book ID
122206890
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
434 KB
Volume
324
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic Edge-Coloring of Planar Graphs
Acyclic Edge-Coloring of Planar Graphs
✍ Basavaraju, Manu; Chandran, L. Sunil; Cohen, Nathann; Havet, Frédéric; Müller, T 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB
Adjacent strong edge coloring of graphs
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

Strong edge colorings of graphs
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