Coloring mixed hypertrees

Discrete Applied Mathematics

Volumn 154, Issue 4, 2006, Pages 660-672

  Král, Daniel ^a   Kratochvíl, Jan ^a   Proskurowski, Andrzej ^b   Voss, Heinz Jürgen ^c  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF OREGON   (United States)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Graph coloring; Hypertrees; Mixed hypergraphs

Indexed keywords

COLORING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

GRAPH COLORING; HYPERTREES; MIXED HYPERGRAPHS;

TREES (MATHEMATICS);

EID: 32544440810     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.05.019     Document Type: Conference Paper

References (30)

1. A. Brandstädt, V.B. Le, J. Spinrad, Graph classes: a survey, SIAM Monographs Discrete Math. Appl. (1999).
2. E. Bulgaru, and V. Voloshin Mixed interval hypergraphs Discrete Appl. Math. 77 1997 24 41
3. C. Colbourn, J. Dinitz, and A. Rosa Bicoloring triple systems Electron. J. Combin. 6 1 1999 #R25
4. Ch.J. Colbourn, and A. Rosa Triple Systems 1999 Clarendon Press Oxford (sect. 18.6. Strict colouring and the upper chromatic number, pp. 340-341)
5. K. Diao, P. Zhao, and H. Zhou About the upper chromatic number of a co-hypergraph Discrete Math. 220 2000 67 73
6. Z. Dvořák, and D. Král On in planar mixed hypergraphs Electron. J. Combin. 8 1 2001 #R35
7. T. Etzion, and A. Hartman Towards a large set of Steiner quadruple systems SIAM J. Discrete Math. 4 1991 182 195
8. E. Flocos The upper chromatic number of simple co-monostars, Anale stiintifice ale Universitatii de Stat din Moldova Seria Stiinte Reale 1997 22 27
9. M.R. Garey, and D.S. Johnson Computers and Intractability, A Guide to the Theory of NP-completeness 1979 Freeman San Franscisco, CA
10. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, and D.B. West The chromatic spectrum of mixed hypergraphs Graphs Combin. 18 2002 309 318
11. D. Kobler, and A. Kündgen Gaps in the chromatic spectrum of face-constrained plane graphs Electron. J. Combin. 8 1 2001 #N3
12. D. Král', On complexity of colouring mixed hypertrees, in: Proceedings of the FTC'01 and WEA'01, Lecture Notes in Computer Science, vol. 2138, Springer, Berlin, 2001, pp. 516-524.
13. D. Král', On feasible sets of mixed hypergraphs, Electronic Journal of Combinatorics 11 (1) (2004) (paper #R19).
14. D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, in: Proceedings of the WG'00, Lecture Notes in Computer Science, vol. 1928, Springer, Berlin, 2000, pp. 279-289.
15. D. Král', J. Kratochvíl, H.-J. Voss, Complexity note on mixed hypergraphs, in: Proceedings of the MFCS'01, Lecture Notes in Computer Science, vol. 2136, Springer, Berlin, 2001, pp. 474-486.
16. D. Král', J. Kratochvíl, and H.-J. Voss Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs Theoret. Comput. Sci. 295 2003 263 278
17. J. Kratochvíl, Z. 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, AMS, Providence, RI, 1999, pp. 183-197.
18. A. Kündgen, E. Mendelsohn, and V. Voloshin Colouring planar mixed hypergraphs Electron. J. Combin. 7 2000 #R60
19. H. Lefmann, V. Rödl, and R. Thomas Monochromatic vs. multicolored paths Graphs Combin. 8 1992 323 332
20. L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L (Catania, 1995) 179-193.
21. L. Milazzo, and Zs. Tuza Upper chromatic number of Steiner triple and quadruple systems Discrete Math. 174 1997 247 259
22. L. Milazzo, and Zs. Tuza Strict colorings for classes of Steiner triple systems Discrete Math. 182 1998 233 243
23. A. Niculitsa, and V. Voloshin About uniquely colorable mixed hypertrees Discuss. Math. Graph Theory 20 1 2000 81 91
24. Z. Tuza, and V. Voloshin Uncolorable mixed hypergraphs Discrete Appl. Math. 99 2000 209 227
25. Z. Tuza, V. Voloshin, and H. Zhou Uniquely colorable mixed hypergraphs Discrete Math. 248 2002 221 236
26. V. Voloshin The mixed hypergraphs Comput. Sci. J. Moldova 1 1993 45 52
27. V. Voloshin On the upper chromatic number of a mixed hypergraph Australasian J. Combin. 11 1995 25 45
28. V. Voloshin Upper chromatic number and C-perfect mixed hypergraphs Paul Erdos and His Mathematics: Research Communications 1999 267 269
29. V. Voloshin Coloring Mixed Hypergraphs: Theory, Algorithms and Applications 2002 AMS Providence, RI
30. A list of publications on Mixed Hypergraph Coloring, available at < http://math.net.md/voloshin/publishe.html >.