Mixed hypergraphs and other coloring problems

Discrete Mathematics

Volumn 307, Issue 7-8, 2007, Pages 923-938

  Král', Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Graph coloring models; Graph homomorphisms; Mixed hypergraphs

Indexed keywords

COLORING; GRAPH THEORY; MATHEMATICAL MODELS; MONOCHROMATORS; SET THEORY;

CHANNEL ASSIGNMENT PROBLEM; GRAPH COLORING MODELS; GRAPH HOMOMORPHISM; MIXED HYPERGRAPHS;

PROBLEM SOLVING;

EID: 33846536217     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.11.050     Document Type: Article

References (31)

1. Bulgaru E., and Voloshin V. Mixed interval hypergraphs. Discrete Appl. Math. 77 (1997) 24-41
2. Díaz J. H-colorings of graphs. Bull. EATCS 75 (2001) 82-92
3. J. Díaz, M. Serna, D. Thilikos, (H, C, K)-coloring: fast, easy and hard cases, in: Mathematical Foundations of Computer Science (MFCS) 2001, Lecture Notes in Computer Science, vol. 2136, 2001, pp. 304-315.
4. J. Díaz, M. Serna, D. Thilikos, The complexity of parametrized H-colorings, in: J. Nešetřil, P. Winkler (Eds.), Graphs, Morphism and Statistical Physics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, to appear.
5. J. Fiala, D. Král', R. Škrekovski, A Brooks-type theorem for the generalized list T-coloring, submitted for publication.
6. Fiala J., and Kratochvíl J. Partial covers of graphs. Discuss. Math. Graph Theory 22 (2002) 89-99
7. J. Fiala, J. Maxová, Cantor-Bernstein type theorem for locally constrained graph homomorphisms, in preparation.
8. J. Fiala, D. Paulusma, The computational complexity of the role assignment problem, in: Automata, Languages and Programming (ICALP) 2003, Lecture Notes in Computer Science, vol. 2719, 2003, pp. 817-828.
9. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
10. Hale W.K. Frequency assignment: theory and applications. Proc. of IEEE 68 (1980) 1497-1514
11. Hell P., and Nešetřil J. On the complexity of H-coloring. J. Combin. Theory Ser. B 48 (1990) 92-110
12. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press, Oxford
13. Jiang T., Mubayi D., Tuza Zs., Voloshin V., and West D.B. The chromatic spectrum of mixed hypergraphs. Graphs Combin. 18 2 (2002) 309-318
14. Král' D. On feasible sets of mixed hypergraphs. Electron. J. Combin. 11 1 (2004) #R19
15. D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, in: Graph-Theoretic Concepts in Computer Science (WG) 2000, Lecture Notes in Computer Science, vol. 1928, 2000, pp. 279-289.
16. Král' D., Kratochvíl J., and Voss H.-J. Mixed hypercacti. Discrete Math. 286 1-2 (2004) 99-113
17. Král' D., and Škrekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
18. J. Kratochvíl, A. Proskurowski, J.A. Telle, Covering directed multigraphs I. Colored directed multigraphs, in: Graph-Theoretic Concepts in Computer Science (WG) 1997, Lecture Notes in Computer Science, vol. 1335, 1997, pp. 242-257.
19. Kratochvíl J., Proskurowski A., and Telle J.A. Complexity of graph covering problems. Nordic J. Comput. 5 (1998) 173-195
20. J. Kratochvíl, Zs. Tuza, M. Voigt, New trends in the theory of graph colorings: choosability and list coloring, in: Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the Future), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, American Mathematical Society, Providence, RI, 1999, pp. 183-197.
21. P. Kristiansen, J.A. Telle, Generalized H-coloring of graphs, in: Algorithms and Computation (ISAAC) 2000, Lecture Notes in Computer Science, vol. 1969, 2000, pp. 456-466.
22. Liu D.D.-F. T-colorings of graphs. Discrete Math. 101 (1992) 203-212
23. McDiarmid C. Discrete mathematics and radio channel assignment. In: Linhares-Salas C., and Reed B. (Eds). Recent Advances in Theoretical and Applied Discrete Mathematics (2001), Springer, Berlin
24. McDiarmid C. On the span in channel assignment problems: bounds, computing and counting. Discrete Math. 266 (2003) 387-397
25. Nešetřil J. Aspects of structural combinatorics (graph homomorphisms and their use). Taiwanese J. Math. 3 (1999) 381-423
26. Roberts F. T-colorings of graphs: recent results and open problems. Discrete Math. 93 (1991) 229-245
27. Vince A. Star chromatic number. J. Graph Theory 12 (1988) 551-559
28. Voloshin V. On the upper chromatic number of a hypergraph. Australasian J. Combin. 11 (1995) 25-45
29. Voloshin V. Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (2002), American Mathematical Society, Providence
30. Voloshin V., and Voss H.-J. Circular mixed hypergraphs I: colorability and unique colorability. Congr. Numer. 144 (2000) 207-219
31. Zhu X. Circular chromatic number: a survey. Discrete Math. 229 (2001) 371-410