Gaps in the chromatic spectrum of face-constrained plane graphs

Electronic Journal of Combinatorics

Volumn 8, Issue 1 N, 2001, Pages 1-4

  Kobler, Daniel ^a   Kündgen, André ^b  

^a FIELDS INSTITUTE   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Chromatic spectrum; Colorability; Colorings of hypergraphs; Mixed hypergraphs; Planar graphs and hypergraphs

Indexed keywords

EID: 4043064868     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1588     Document Type: Article

References (5)

1. M. Funk, B. Jackson, D. Labbate and J. Sheehan, 2-Factor Hamiltonian Graphs, hardcopy preprint 2000115, University of Aberdeen (2000).
2. 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.
3. A. Kündgen, E. Mendelsohn, V. Voloshin, Colouring planar mixed hypergraphs, Electron. J. Combin. 7 (2000), #R60.
4. V. Voloshin, The mixed hypergraphs, Computer Science Journal of Moldova 1 (1993), 45-52.
5. V. Voloshin, On the upper chromatic number of a hypergraph, Australasian Journal of Combinatorics 11 (1995), 25-45.