✦ LIBER ✦

Incidence and strong edge colorings of graphs

✍ Scribed by Richard A. Brualdi; Jennifer J. Quinn Massey

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 485 KB
Volume: 122
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90286-3

No coin nor oath required. For personal study only.

✦ Synopsis

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 are divisible by 4.

📜 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

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′__(_

Equitable edge-colorings of simple graph

Equitable edge-colorings of simple graphs

✍ Xia Zhang; Guizhen Liu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

An edge-coloring of a graph G is equitable if, for each v ∈ V (G), the number of edges colored with any one color incident with v differs from the number of edges colored with any other color incident with v by at most one. A new sufficient condition for equitable edge-colorings of simple graphs is

Vertex-distinguishing edge colorings of

Vertex-distinguishing edge colorings of graphs

✍ P. N. Balister; O. M. Riordan; R. H. Schelp 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB 👁 1 views

Circular colorings of edge-weighted grap

Circular colorings of edge-weighted graphs

✍ Bojan Mohar 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract The notion of (circular) colorings of edge‐weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs

Computer generation of edge groups and e

Computer generation of edge groups and edge colorings of graphs

✍ Xiaoyu Liu; K. Balasubramanian 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 810 KB

A computer code and nonnumerical algorithm are developed to construct the edge group of a graph and to enumerate the edge colorings of graphs of chemical interest. The edge colorings of graphs have many applications in nuclear magnetic resonance (NMR), multiple quantum NMR, enumeration of structural