About the upper chromatic number of a co-hypergraph (Q1567608): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1596773
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / author
 
Property / author: Hui Shan Zhou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 03:56, 5 March 2024

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
    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