Colouring planar mixed hypergraphs

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-13

  Kündgen, André ^a   Mendelsohn, Eric ^b   Voloshin, Vitaly ^c  

^a FIELDS INSTITUTE   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

Chromatic spectrum; Colourability; Colourings of hypergraphs; Mixed hypergraphs; Planar graphs and hypergraphs

Indexed keywords

EID: 0009788314     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1538     Document Type: Article

References (17)

1. C. Berge, Graphs and Hypergraphs, North Holland, 1973.
2. C. Berge, Hypergraphs: Combinatorics of finite sets, North Holland, 1989.
3. C. Colbourn, J. Dinitz and A. Rosa, Bicoloring Triple Systems Electronic J. Combin. 6# 1, paper 25, 16 pages (electronic).
4. Ch.J. Colbourn and A. Rosa, Triple Systems. Clarendon Press, Oxford, 1999 (sect.18.6. Strict colourings and the upper chromatic number, p.340-341).
5. M. Funk, B. Jackson, D. Labbate and J. Sheehan, 2-Factor Hamilton Graphs, preprint.
6. 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.
7. 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.
8. J.G. Penaud, Une propriété de bicoloration des hypergraphes planaires. (French) Colloque sur la Théorie des Graphes (Paris, 1974) Cahiers Centre Études Recherche Óper. 17 (1975), 345-349.
9. A.G. Thomason, Hamiltonian cycles and uniquely edge colourable graphs, Annals of Discrete Math. 3 (1978), 259-268.
10. W.T. Tutte, On Hamiltonian circuits J. London Math. Soc. 21 (1946), 98-101.
11. Zs. Tuza and V. Voloshin, Uncolourable mixed hypergraphs, Discrete Appl. Math. 99 (2000), 209-227.
12. Zs. Tuza, V. Voloshin and H. Zhou, Uniquely colourable mixed hypergraphs, submitted.
13. V. Voloshin, The mixed hypergraphs, Computer Science Journal of Moldova 1 (1993), 45-52.
14. V. Voloshin, On the upper chromatic number of a hypergraph, Australasian Journal of Combinatorics 11 (1995), 25-45.
15. V. Voloshin and H.-J. Voss, Circular Mixed Hypergraphs I: colourability and unique colourability, Congressus Numerantium, 142{147 2000, in print.
16. D.B. West, Introduction to Graph Theory. Prentice Hall, 1996.
17. A.A. Zykov, Hypergraphs (in Russian), Uspekhi Mat. Nauk 29 (1974), 89-154.