✦ LIBER ✦

Hard colour

✍ Scribed by Ramtek Corporation

Book ID: 103046756
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 185 KB
Volume: 12
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(80)90010-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hard colour copy

📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Colour hard-copy

📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Colour of hard cheese

✍ Harald Rohm; Doris Jaros 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 408 KB

Hereditarily hard H-colouring problems

✍ Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 997 KB

Let H be a graph (respectively digraph) whose vertices are called ~colours'. An H-colourinq of a graph (respectively digraph) G is an assignment of these colours to the vertices of G so that if u is adjacent to v in G, then the colour of u is adjacent to the colour of v in H. We continue the study o

HARDNESS AND COLOUR OF IKSEC'T CUTICLE

✍ Pryor, M. G. H. 📂 Article 📅 2009 🏛 Wiley (Blackwell Publishing) 🌐 English ⚖ 159 KB

Determining the total colouring number i

Determining the total colouring number is np-hard

✍ Abdón Sánchez-Arroyo 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 279 KB

In this paper it is proved that the problem of deteruzining the totai chromatic number of an arbitrary'graph is NP-hard. The problem remains NP-hard even for cubic bipartite graphs.