Le nombre minimal de colorations d'un hypergraphe k-chromatique (Q1255502): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of graphs / rank
 
Normal rank

Latest revision as of 01:41, 13 June 2024

scientific article
Language Label Description Also known as
English
Le nombre minimal de colorations d'un hypergraphe k-chromatique
scientific article

    Statements

    Le nombre minimal de colorations d'un hypergraphe k-chromatique (English)
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    Minimal Number of Colourings
    0 references
    Colouring of a Hypergraph
    0 references
    Chromatic Number
    0 references