Computing the chromatic index of Steiner Triple systems

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


A branch-and-bound algorithm for finding an optimal colouring of the blocks of a Steiner triple system is developed. Two simple but powerful heuristics are devised which improve the method. Applications to scheduling and the design of experiments are outlined.

Original languageEnglish (US)
Pages (from-to)338-339
Number of pages2
JournalComputer Journal
Issue number3
StatePublished - Aug 1982
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Computing the chromatic index of Steiner Triple systems'. Together they form a unique fingerprint.

Cite this