On chromaticity of hypergraphs (Q878636)

From MaRDI portal
Revision as of 18:14, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On chromaticity of hypergraphs
scientific article

    Statements

    On chromaticity of hypergraphs (English)
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    The authors consider an extension of the chromatic polynomial to hypergraphs and prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs.
    0 references
    0 references
    0 references
    chromatic polynomial
    0 references
    hypergraph
    0 references
    hypertree
    0 references
    0 references