Colouring steiner quadruple systems

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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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
Volume4
Issue number2
DOIs
StatePublished - 1982
Externally publishedYes

Fingerprint

Steiner Quadruple System
Coloring
Colouring
NP-complete problem
Polynomials
Partial
Polynomial

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Colouring steiner quadruple systems. / Colbourn, Charles; Colbourn, Marlene J.; Phelps, Kevin T.; Rödl, Vojtěch.

In: Discrete Applied Mathematics, Vol. 4, No. 2, 1982, p. 103-111.

Research output: Contribution to journalArticle

Colbourn, Charles ; Colbourn, Marlene J. ; Phelps, Kevin T. ; Rödl, Vojtěch. / Colouring steiner quadruple systems. In: Discrete Applied Mathematics. 1982 ; Vol. 4, No. 2. pp. 103-111.
@article{c984c73227c841de952765ad891d6929,
title = "Colouring steiner quadruple systems",
abstract = "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.",
author = "Charles Colbourn and Colbourn, {Marlene J.} and Phelps, {Kevin T.} and Vojtěch R{\"o}dl",
year = "1982",
doi = "10.1016/0166-218X(82)90068-3",
language = "English (US)",
volume = "4",
pages = "103--111",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Colouring steiner quadruple systems

AU - Colbourn, Charles

AU - Colbourn, Marlene J.

AU - Phelps, Kevin T.

AU - Rödl, Vojtěch

PY - 1982

Y1 - 1982

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

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

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

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

U2 - 10.1016/0166-218X(82)90068-3

DO - 10.1016/0166-218X(82)90068-3

M3 - Article

AN - SCOPUS:49049137133

VL - 4

SP - 103

EP - 111

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -