Kündgen, André; Mendelsohn, Eric; Voloshin, Vitaly Colouring planar mixed hypergraphs. (English) Zbl 0978.05027 Electron. J. Comb. 7, No. 1, Research paper R60, 13 p. (2000); printed version J. Comb. 7, No. 2 (2000). The authors show that maximal planar bi-hypergraphs are 2-colorable. They also find formulas for their chromatic polynomial and chromatic spectrum in terms of 2-factors in the dual. Furthermore, they show that their chromatic spectrum is gap-free and give an estimate on the number of colors in a coloring. Reviewer: Michael Raines (Kalamazoo) Cited in 1 ReviewCited in 16 Documents MSC: 05C15 Coloring of graphs and hypergraphs Keywords:colourings of hypergraphs; mixed hypergraphs; planar graphs and hypergraphs; colourability; chromatic spectrum PDFBibTeX XMLCite \textit{A. Kündgen} et al., Electron. J. Comb. 7, No. 1, Research paper R60, 13 p. (2000; Zbl 0978.05027) Full Text: EuDML EMIS