𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The dichromatic number of a digraph

✍ Scribed by V Neumann-Lara

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
321 KB
Volume
33
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spectral radius of digraphs with given d
Spectral radius of digraphs with given dichromatic number
✍ Huiqiu Lin; Jinlong Shu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 237 KB

Let D be a digraph with vertex set V (D). A partition of V (D) into k acyclic sets is called a k-coloring of D. The minimum integer k for which there exists a k-coloring of D is the dichromatic number Ο‡(D) of the digraph D. Denote G n,k the set of the digraphs of order n with the dichromatic number

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

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