✦ LIBER ✦

A bibliographic survey of edge-colorings

✍ Scribed by S. Fiorini

Book ID: 102892045
Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 680 KB
Volume: 2
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190020202

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

This paper presents a bibliography on edge‐colorings of graphs which is as complete as possible to date. We introduce the papers by a brief discussion of the ideas involved.

📜 SIMILAR VOLUMES

Balanced edge colorings

✍ P.N. Balister; A. Kostochka; Hao Li; R.H. Schelp 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 309 KB

Even edge colorings of a graph

✍ B. Devadas Acharya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Even edge colorings of a graph

✍ Noga Alon; Yoshimi Egawa 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 59 KB

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

Edge Colorings of Embedded Graphs

✍ Zhongde Yan; Yue Zhao 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 125 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