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

From MaRDI portal
Revision as of 09:06, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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