Greedy colourings of steiner triple systems

C. J. Colbourn; M. J. Colbourn

doi:10.1016/S0304-0208(08)73302-4

Greedy colourings of steiner triple systems

C. J. Colbourn, M. J. Colbourn

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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)
Pages (from-to)	201-207
Number of pages	7
Journal	North-Holland Mathematics Studies
Volume	78
Issue number	C
DOIs	https://doi.org/10.1016/S0304-0208(08)73302-4
State	Published - Jan 1 1983
Externally published	Yes

ASJC Scopus subject areas

Mathematics(all)

Access to Document

10.1016/S0304-0208(08)73302-4

Cite this

@article{50b5345b4b064f22a49dee718b0def71,

title = "Greedy colourings of steiner triple systems",

abstract = "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.",

author = "Colbourn, {C. J.} and Colbourn, {M. J.}",

note = "Funding Information: ACKNOWLEDGEMENTS: Research supported by NSERC Canada Grant A5047.",

year = "1983",

month = jan,

day = "1",

doi = "10.1016/S0304-0208(08)73302-4",

language = "English (US)",

volume = "78",

pages = "201--207",

journal = "North-Holland Mathematics Studies",

issn = "0304-0208",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Greedy colourings of steiner triple systems

AU - Colbourn, C. J.

AU - Colbourn, M. J.

N1 - Funding Information: ACKNOWLEDGEMENTS: Research supported by NSERC Canada Grant A5047.

PY - 1983/1/1

Y1 - 1983/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77956912633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956912633&partnerID=8YFLogxK

U2 - 10.1016/S0304-0208(08)73302-4

DO - 10.1016/S0304-0208(08)73302-4

M3 - Article

AN - SCOPUS:77956912633

SN - 0304-0208

VL - 78

SP - 201

EP - 207

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

IS - C

ER -

Greedy colourings of steiner triple systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this