𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the upper chromatic numbers of the reals

✍ Scribed by Aaron F. Archer

Book ID
108316400
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
107 KB
Volume
214
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The kth upper chromatic number of the li
The kth upper chromatic number of the line
✍ Aaron Abrams πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 252 KB

Let S C ~', and let k E β€’. Greenwell and Johnson [3] define ~k)(S) to be the smallest integer m (if such an integer exists) such that for every k Γ— m array D = (dq) of positive real numbers, S can be colored with the colors Ca ..... Cm such that no two points of S which are a (Euclidean) distance di

A new upper bound on the cyclic chromati
A new upper bound on the cyclic chromatic number
✍ O. V. Borodin; H. J. Broersma; A. Glebov; J. van den Heuvel πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 160 KB πŸ‘ 1 views

## Abstract A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number Ο‡^__c__^. Let Ξ”^\*^ be the maximum face degree of a graph. There exist

Some upper bounds on the total and list
Some upper bounds on the total and list chromatic numbers of multigraphs
✍ Roland HΓ€ggkvist; Amanda Chetwynd πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 762 KB

## Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an __n__‐order multigraph exceeds the chromatic index by the smallest __t__ such that __t__! > __n__.