✦ LIBER ✦

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ Scribed by N. Zagaglia Salvi

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 126 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170504

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let λ(G) be the line‐distinguishing chromatic number and x′(G) the chromatic index of a graph G.

📜 SIMILAR VOLUMES

A note on the star chromatic number

✍ J. A. Bondy; Pavol Hell 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

## Abstract A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of interest. His work relies on continuous methods. In this note we make some simple observations that lead to a purely combinatorial treatment. Our methods yield sho

The star chromatic number of a graph

✍ H. L. Abbott; B. Zhou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB 👁 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

Chromatic Number and the 2-Rank of a Gra

Chromatic Number and the 2-Rank of a Graph

✍ C.D. Godsil; Gordon F. Royle 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001

On the chromatic number of a random 5-re

On the chromatic number of a random 5-regular graph

✍ J. Díaz; A. C. Kaporis; G. D. Kemkes; L. M. Kirousis; X. Pérez; N. Wormald 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is as