Abstract
Purchase PDF (793 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (602 K)
2
doi:10.1016/0166-218X(88)90039-X 
Copyright © 1988 Published by Elsevier Science B.V. All rights reserved.
The strong chromatic number of partial triple systems
Received 29 January 1986;
revised 5 August 1986.
Available online 27 March 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
A strong colouring of a hypergraph is an assignment of colours to its vertices so that no two vertices in a hyperedge have the same colour. We establish that strong colouring of partial triple systems is NP-complete, even when the number of colours is any fixed k≥3. In contrast, an efficient algorithm is given for strong colouring of maximal partial triple systems. Observations in this algorithm underpin a complete determination of the spectrum of strong chromatic numbers for maximal partial triple systems.
