Abstract
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.
The research was done as a part of DIMACS/DIMATIA REU 2001 programme. The REU programme was supported by KONTAKT ME 337.
Supported by Ministry of Education of Czech Republic as project LN00A056.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Electronic J. Combin. 6# 1, 1999, paper 25, 16 pages.
M. R. Garey, D. S. Johnson: Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman, San Franscisco, Cal., 1979.
L. Haddad: On the chromatic numbers of Steiner triple systems, J. Combinat. Designs 7, 1999, 1–10.
T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West: The Chromatic Spectrum of Mixed Hypergraphs Graphs Comb. 18 2, 2002, 309–318.
D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss: Coloring mixed hypertrees, Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS vol. 1928, 2000, 279–289.
D. Král': On Complexity of Colouring Mixed Hypertrees, Proceedings 13th Symposium Fundamentals of Computation Theory, 1stWorkshop on Efficient Algorithms, LNCS vol. 2138, 2001, 516–524.
D. Král', J. Kratochvíl, H.-J. Voss: Mixed Hypergraphs with Bounded Degree: Edge-Colouring of Mixed Multigraphs, to appear in Theoretical Computer Science.
C. C. Lindner, C. A. Roger: Decomposition into cycles II: Cycle Systems, Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson (eds.), John Wiley and Son, New York, 1992, 325–369.
L. Milazzo and Zs. Tuza: Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997), 247–259.
L. Milazzo and Zs. Tuza: Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998), 233–243.
G. Quattrocchi: Colouring 4-cycle systems with specified block colour patterns: the case of embedding P3-designs, Electronic J. Combinatorics 8, 2001, #R24.
T. J. Schaefer: The complexity of satisfiability problems, Proc. of the Tenth Annual ACM Symposium on Theory of Computing (STOC), 1978, 216–226.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dvořák, Z., Kára, J., Král', D., Pangrác, O. (2002). Complexity of Pattern Coloring of Cycle Systems. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_15
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive