Upper chromatic number of Steiner triple and quadruple systems
Proceedings of the international conference on Combinatorics '94
Strict colouring for classes of Steiner triple systems
Discrete Mathematics - Special issue on Graph theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On Complexity of Colouring Mixed Hypertrees
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
A k-cycle system is a system of cyclically ordered k-tuples of a finite set. A pattern is a sequence of letters. A coloring of a k-cycle system with respect to a set of patterns of length k is proper iff each cycle is colored consistently with one of the patterns, i.e. the same/distinct letters correspond to the same/distinct color(s). We prove a dichotomy result on the complexity of coloring a given cycle system with a fixed set of patterns P by at most l colors and discuss possible generalizations.