Colouring planar mixed hypergraphs (Q1591737)

From MaRDI portal
Revision as of 16:03, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Colouring planar mixed hypergraphs
scientific article

    Statements

    Colouring planar mixed hypergraphs (English)
    0 references
    0 references
    0 references
    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

    Identifiers