𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on the analysis of chromatic drawings

✍ Scribed by John T. Payne


Publisher
John Wiley and Sons
Year
1949
Tongue
English
Weight
166 KB
Volume
5
Category
Article
ISSN
0021-9762

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On an analysis of draw resonance by Hyun
✍ Morton M. Denn πŸ“‚ Article πŸ“… 1980 πŸ› American Institute of Chemical Engineers 🌐 English βš– 367 KB
On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; WeiοΏ½enfels, Gerhard πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the complexity of the circular chroma
✍ H. Hatami; R. Tusserkani πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 71 KB πŸ‘ 1 views

## Abstract Circular chromatic number, Ο‡~__c__~ is a natural generalization of chromatic number. It is known that it is **NP**‐hard to determine whether or not an arbitrary graph __G__ satisfies Ο‡(__G__)=Ο‡~__c__~(__G__). In this paper we prove that this problem is **NP**‐hard even if the chromatic