✦ LIBER ✦

Two results on the digraph chromatic number

✍ Scribed by Ararat Harutyunyan; Bojan Mohar

Book ID: 113567592
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 191 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.01.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The circular chromatic number of a digra

The circular chromatic number of a digraph

✍ Drago Bokal; Gas̆per Fijavz; Martin Juvan; P. Mark Kayll; Bojan Mohar 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract We introduce the circular chromatic number χ~__c__~ of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directe

TWO RESULTS ON GENERALIZED CHROMATIC NUM

TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS

✍ Broere, Izak; Frick, Marietjie 📂 Article 📅 1990 🏛 Taylor and Francis Group 🌐 English ⚖ 225 KB

The circular chromatic numbers of planar

The circular chromatic numbers of planar digraphs

✍ Chin-Ann Soh 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

## Abstract The circular chromatic number is a refinement of the chromatic number of a graph. It has been established in [3,6,7] that there exists planar graphs with circular chromatic number __r__ if and only if __r__ is a rational in the set {1} ∪ [2,4]. Recently, Mohar, in [1,2] has extended the

Recent results on the total chromatic nu

Recent results on the total chromatic number

✍ A.J.W. Hilton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Hilton, A.J.W., Recent results on the total chromatic number, Discrete Mathematics 111 (1993) 323-331. We give a survey of various recent results concerning the total chromatic number of simple graphs.

Some results on the injective chromatic

Some results on the injective chromatic number of

✍ Min Chen, Geňa Hahn, André Raspaud, Weifan Wang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 630 KB

On the mean chromatic number

✍ Martin Anthony 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The mean chromatic number of a graph is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. Some results on the value of the mean chromatic number and its asymptotic behaviour are presented.