𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong edge-coloring for cubic Halin graphs

✍ Scribed by Gerard Jennhwa Chang; Daphne Der-Fen Liu

Book ID
113567578
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
397 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The strong chromatic index of complete c
The strong chromatic index of complete cubic Halin graphs
✍ W.C. Shiu; W.K. Tam 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 809 KB

A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.

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-coloring of planar graphs
Strong edge-coloring of planar graphs
✍ Hudák, Dávid; Lužar, Borut; Soták, Roman; Škrekovski, Riste 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 434 KB
Optimal acyclic edge-coloring of cubic g
Optimal acyclic edge-coloring of cubic graphs
✍ Lars Døvling Andersen; Edita Máčajová;; Ján Mazák 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

An __acyclic edge‐coloring__ of a graph is a proper edge‐coloring such that the subgraph induced by the edges of any two colors is acyclic. The __acyclic chromatic index__ of a graph __G__ is the smallest number of colors in an acyclic edge‐coloring of __G__. We prove that the acyclic chromatic inde

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