Colouring planar mixed hypergraphs (Q1591737)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Colouring planar mixed hypergraphs |
scientific article; zbMATH DE number 1549888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring planar mixed hypergraphs |
scientific article; zbMATH DE number 1549888 |
Statements
Colouring planar mixed hypergraphs (English)
0 references
9 January 2001
0 references
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.
0 references
colourings of hypergraphs
0 references
mixed hypergraphs
0 references
planar graphs and hypergraphs
0 references
colourability
0 references
chromatic spectrum
0 references
0.8966585397720337
0 references
0.8966585397720337
0 references
0.8853611350059509
0 references
