𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of (2,2) path chromatic number problem

✍ Scribed by Yuan Jinjiang

Book ID
112818988
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
1995
Tongue
English
Weight
259 KB
Volume
10
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of the circular chroma
On the complexity of the circular chromatic number
✍ 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

Chromatic Number and the 2-Rank of a Gra
Chromatic Number and the 2-Rank of a Graph
✍ C.D. Godsil; Gordon F. Royle πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001