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.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics