Colouring planar mixed hypergraphs
type: Item
instance of: scholarly article
title: Colouring planar mixed hypergraphs
zbMATH Open document ID: 0978.05027
author: André Kündgen
author: Eric Mendelsohn
author: V. I. Voloshin
published in: The Electronic Journal of Combinatorics
publication date: 2001-01-09T00:00:00Z
full work available at URL: https://eudml.org/doc/121523
full work available at URL: v7i1r60.html
review text: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1549888
zbMATH Keywords: colourings of hypergraphs
zbMATH Keywords: mixed hypergraphs
zbMATH Keywords: planar graphs and hypergraphs
zbMATH Keywords: colourability
zbMATH Keywords: chromatic spectrum
reviewed by: Michael Raines
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1549888