On planar mixed hypergraphs

Electronic Journal of Combinatorics

Volumn 8, Issue 1 R, 2001, Pages 1-23

  Dvořák, Zdeněk ^a   Král', Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Algorithms for coloring; Coloring of hypergraphs; Mixed hypergraphs; Planar graphs and hypergraphs

Indexed keywords

EID: 0742275478     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1579     Document Type: Article

References (24)

1. C. Berge: Graphs and Hypergraphs, North Holland, 1973.
2. C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Electronic J. Combin. 6 (1), 1999, R25, 16 pages.
3. C. J. Colbourn, A. Rosa: Triple Systems, Clarendon Press, Oxford, 1999, sect. 18.6. Strict colouring and the upper chromatic number, 340-341.
4. T. Etzion and A. Hartman: Towards a large set of Steiner quadruple systems, SIAM J. Discrete Math. 4 (1991), 182-195.
5. M. R. Fellows, J. Kratochvíl, M. Middendorf, F. Pfeiffer: The complexity of induced minors and related problems, Algorithmica 13, 1995, 266-282.
6. M. R. Garey, D. S. Johnson: Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman, San Franscisco, Cal., 1979.
7. M. R. Garey, D. S. Johnson, R. E. Tarjan: The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM J. Comput., 5(4), 1976, 704-714.
8. F. Hadlock: Finding a Maximum Cut of a Planar Graph in Polynomial Time, SIAM J. Comput. 4(3), 1975, 221-225.
9. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West: Chromatic spectrum is broken, 6th Twente Workshop on Graphs and Combinatorial Optimization, 26-28, May, 1999, H. J. Broersma, U. Faigle and J. L. Hurink (eds.), University of Twente, May, 1999, 231-234.
10. D. Kobler, A. Kündgen: Gaps in the chromatic spectrum of face-constrained plane graphs, Electronic J. Combin. 3, 2001, #N3.
11. D. Král': On Complexity of Colouring Mixed Hypertrees, Proceedings 13th International Symposium on Fundamentals of Computing Theory, 1st International Workshop on Efficient Algorithms, LNCS vol. 2138, 2001, 516-524.
12. 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.
13. D. Král', J. Kratochvíl, H.-J. Voss: Complexity Note on Mixed Hypergraphs, Proceedings 26th International Symposium on Mathematical Foundations of Computer Science, LNCS vol. 2136, 2001, 474-486.
14. J. Kratochvíl, Zs. Tuza: On the complexity of bicoloring clique hypergraphs of graphs, extended abstract, 11th Annual ACM-SIAM Conference on Discrete Algorithms, SODA 2000, 40-41.
15. A. Kündgen, E. Mendelsohn, V. Voloshin: Colouring planar mixed hypergraphs, Electronic J. Combin. 7, 2000, #R60.
16. H. Lefmann, V. Rödl, and R. Thomas: Monochromatic vs. multicolored paths, Graphs Combin. 8 (1992), 323-332.
17. D. Lichtestein: Planar formulae and their uses, SIAM J. Comput. 11, 1982, 329-343.
18. L. Milazzo: On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L (Catania, 1995), 179-193.
19. L. Milazzo and Zs. Tuza: Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997), 247-259.
20. L. Milazzo and Zs. Tuza: Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998), 233-243.
21. J. G. Penaud: Une propriété de bicoloration des hypergraphes planaires (in French), Colloque sur la Théorie des Graphes, Paris, 1974, Cahiers Centre Études Recherche Opér. 17, 1975, 345-349.
22. V. Voloshin: The mixed hypergraphs, Computer Science Journal of Moldova 1, 1993, 45-52.
23. V. Voloshin: On the upper chromatic number of a hypergraph, Australasian Journal of Combinatorics 11, 1995, 25-45.
24. A. A. Zykov: Hypergraphs (in Russian), Uspekhi Mat. Nauk 29, 1974, 89-154.