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

From MaRDI portal
Revision as of 18:29, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(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

    title
    On the complexity of bicoloring clique hypergraphs of graphs (English)
    0 references
    author
    Jan Kratochvíl
    0 references
    Zsolt Tuza
    0 references
    publication date
    14 May 2003
    0 references
    zbMATH DE Number
    1910757
    0 references
    zbMATH Keywords
    clique hypergraph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4806592&oldid=28938745"
    Powered by MediaWiki