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
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
## 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