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 language||English (US)|
|Number of pages||7|
|Journal||North-Holland Mathematics Studies|
|State||Published - Jan 1 1983|
ASJC Scopus subject areas