On k-chromatically unique and k-chromatically equivalent hypergraphs (Q3439412): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromaticity of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic polynomials of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to chromatic polynomials / rank
 
Normal rank

Latest revision as of 19:10, 25 June 2024

scientific article
Language Label Description Also known as
English
On k-chromatically unique and k-chromatically equivalent hypergraphs
scientific article

    Statements

    On k-chromatically unique and k-chromatically equivalent hypergraphs (English)
    0 references
    29 May 2007
    0 references
    colourings of hypergraphs
    0 references
    chromatic polynomials of hypergraphs
    0 references
    chromatically equivalence
    0 references

    Identifiers