About the upper chromatic number of a co-hypergraph (Q1567608)

From MaRDI portal
Revision as of 00:53, 29 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1596773)
scientific article
Language Label Description Also known as
English
About the upper chromatic number of a co-hypergraph
scientific article

    Statements

    About the upper chromatic number of a co-hypergraph (English)
    0 references
    0 references
    0 references
    3 December 2000
    0 references
    The authors investigate cohypergraphs, i.e. hypergraphs with only coedges, with respect to colouring. The relationship between the lower bound of the size of the coedges and the lower bound of the upper chromatic numbers is explored. Necessary and sufficient conditions for determining the upper chromatic number of a cohypergraph are provided.
    0 references
    cohypergraphs
    0 references
    hypergraphs
    0 references
    colouring
    0 references
    chromatic numbers
    0 references

    Identifiers