On the complexity of bicoloring clique hypergraphs of graphs (Q4806592)

From MaRDI portal
Revision as of 02:03, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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