Colouring steiner quadruple systems

Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtěch Rödl

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


An algorithm is described which finds a proper 2-colouring of a Steiner quadruple system if one exists; the time required by this method is polynomial. By way of contrast, 2-colouring a partial Steiner quadruple system is shown to be NP-complete.

Original languageEnglish (US)
Pages (from-to)103-111
Number of pages9
JournalDiscrete Applied Mathematics
Issue number2
StatePublished - Apr 1982
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Colouring steiner quadruple systems'. Together they form a unique fingerprint.

Cite this