On feasible sets of mixed hypergraphs

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages

  Král', Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Algorithms for coloring; Coloring of hypergraphs; Mixed hypergraphs

Indexed keywords

EID: 3042619529     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1772     Document Type: Article

References (23)

1. 2)-configurations, Discrete Appl. Math. 120 (2002), 3-12.
2. C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Electronic J. Combin. 6(1) (1999), #R25.
3. Ch. J. Colbourn, A. Rosa: Triple Systems, Clarendon Press, Oxford (1999), sect. 18.6. Strict colouring and the upper chromatic number, 340-341.
4. Z. Dvor̂ák, D. Král': On Planar Mixed Hypergraphs, Electronic J. Combin. 8 (1) (2001), #R35.
5. M. M. Halldórsson: A still better performance guarantee for approximate graph coloring, Inform. Process. Lett. 45 (1993), 19-23.
6. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. B. West: The chromatic spectrum of mixed hypergraphs, Graphs and Combin. 18(2) (2002), 309-318.
7. D. Kobler, A. Kündgen: Gaps in the chromatic spectrum of face-constrained plane graphs, Electronic J. Combin. 8 (1) (2001), #N3.
8. D. Král': A counter-example to Voloshin's hypergraph co-perfectness conjecture, Australasian Journal on Combinatorics 27 (2003), 253-262.
9. D. Král': Mixed hypergraphs and other graph coloring problems, submitted. Available as ITI report 2003-160.
10. D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss: Coloring mixed hypertrees, to appear in Discrete Appl. Math..
11. D. Král', J. Kratochvíl, H.-J. Voss: Complexity Note on Mixed Hypergraphs, in: Proc. 26th International Symposium, Mathematical Foundations of Computer Science 2001 (MFCS'01), LNCS vol. 2136 (2001), Springer-Verlag, 474-486.
12. D. Král', J. Kratochvíl, H.-J. Voss: Mixed Hypegraphs with Bounded Degree: Edge-Coloring of Mixed Multigraphs, Theoretical Comp. Science 295 (2003), 263-278.
13. D. Král', J. Kratochvíl, H.-J. Voss: Mixed hypercacti, to appear in Discrete Math..
14. 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, American Mathematical Society, Providence, RI (1999), 183-197.
15. A. Kündgen, E. Mendelsohn, V. Voloshin: Colouring planar mixed hypergraphs, Electronic J. Combin. 7 (2000), #R60.
16. H. Lefmann, V. Rödl, R. Thomas: Monochromatic vs. multicolored paths, Graphs Combin. 8 (1992), 323-332.
17. L. Milazzo, Zs. Tuza: Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997), 247-259.
18. L. Milazzo, Zs. Tuza: Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998), 233-243.
19. R. Scapellato, V. Voloshin: Some results on coloring of mixed hypergraphs, Rend. Semin. Mat. Messina Ser. II 20 5 (1999), 149-165.
20. Zs. Tuza, V. Voloshin, H. Zhou: Uniquely colorable mixed hypergraphs, Discrete Math. 248 (2002), 221-236.
21. V. Voloshin: Coloring mixed hypergraphs: Theory, algorithms and applications, AMS, Providence, 2002.
22. V. Voloshin: On the upper chromatic number of a mixed hypergraph, Australasian Journal of Combin. 11 (1995), 25-45.
23. V. Voloshin: The mixed hypergraphs, Computer Science Journal of Moldova 1 (1993), 45-52.