Greedy colourings of steiner triple systems

C. J. Colbourn, M. J. Colbourn

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Three greedy algorithms for colouring the blocks of Steiner triple systems are described; worst-case colourings are studied for each, and their practical use is examined using the eighty Steiner triple systems on fifteen elements.

Original languageEnglish (US)
Pages (from-to)201-207
Number of pages7
JournalNorth-Holland Mathematics Studies
Issue numberC
StatePublished - Jan 1 1983
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'Greedy colourings of steiner triple systems'. Together they form a unique fingerprint.

Cite this