On the complexity of bicoloring clique hypergraphs of graphs (Q4806592): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 18:29, 5 March 2024

scientific article; zbMATH DE number 1910757
Language Label Description Also known as
English
On the complexity of bicoloring clique hypergraphs of graphs
scientific article; zbMATH DE number 1910757

    Statements

    On the complexity of bicoloring clique hypergraphs of graphs (English)
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    clique hypergraph
    0 references