The strong chromatic number of partial triple systems

Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa

Research output: Contribution to journalArticle

5 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)31-38
Number of pages8
JournalDiscrete Applied Mathematics
Volume20
Issue number1
DOIs
StatePublished - May 1988
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The strong chromatic number of partial triple systems'. Together they form a unique fingerprint.

  • Cite this