✦ LIBER ✦

Adjacent strong edge coloring of graphs

✍ Scribed by Zhongfu Zhang; Linzhong Liu; Jianfang Wang

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 242 KB
Volume: 15
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(02)80015-5

No coin nor oath required. For personal study only.

✦ Synopsis

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. In this paper, we discuss some properties of xhs(G), and obtain the xbs(G) of some special graphs and present a conjecture: if G are graphs whose order of each component is at least six, then xhs(G) 5 A(G) +2, where A(G) is the maximum degree of G.

📜 SIMILAR VOLUMES

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

Optimal strong parity edge-coloring of c

Optimal strong parity edge-coloring of complete graphs

✍ David P. Bunde; Kevin Milans; Douglas B. West; Hehui Wu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 434 KB

A Note on Adjacent Strong Edge Coloring

A Note on Adjacent Strong Edge Coloring ofK(n,m)

✍ Jing-wen Li; Zhong-fu Zhang; Xiang-en Chen; Yi-rong Sun 📂 Article 📅 2006 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 130 KB

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

Edge-Coloring Bipartite Graphs

✍ Ajai Kapoor; Romeo Rizzi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Given a bipartite graph G with n nodes, m edges, and maximum degree ⌬, we Ž . find an edge-coloring for G using ⌬ colors in time T q O m log ⌬ , where T is the time needed to find a perfect matching in a k-regular bipartite graph with Ž . O m edges and k F ⌬. Together with best known bounds for T th

Semistrong edge coloring of graphs

✍ András Gyárfás; Alice Hubenko 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract Weakening the notion of a strong (induced) matching of graphs, in this paper, we introduce the notion of a semistrong matching. A matching __M__ of a graph __G__ is called semistrong if each edge of __M__ has a vertex, which is of degree one in the induced subgraph __G__[__M__]. We stre