𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circular Coloring of Planar Digraphs

✍ Scribed by Guanghui Wang, Bin Liu, Jiguo Yu, Guizhen Liu

Book ID
118783105
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
345 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Exponents of 2-coloring of symmetric dig
Exponents of 2-coloring of symmetric digraphs
✍ Yanling Shao; Yubin Gao πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 151 KB

A 2-coloring (G 1 , G 2 ) of a digraph is 2-primitive if there exist nonnegative integers h and k with h + k > 0 such that for each ordered pair (u, v) of vertices there exists an is the minimum value of h + k taken over all such h and k. In this paper, we consider 2-colorings of strongly connected

Gallai's Theorem for List Coloring of Di
Gallai's Theorem for List Coloring of Digraphs
✍ Harutyunyan, Ararat; Mohar, Bojan πŸ“‚ Article πŸ“… 2011 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 264 KB
Arc Colorings of Digraphs
Arc Colorings of Digraphs
✍ C.C Harner; R.C Entringer πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 353 KB