Colouring planar mixed hypergraphs (Q1591737): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Vitaly I. Voloshin / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Michael E. Raines / rank | |||
Normal rank | |||
Revision as of 19:17, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colouring planar mixed hypergraphs |
scientific article |
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
