Covering graphs with few complete bipartite subgraphs (Q1019181)

From MaRDI portal
Revision as of 15:02, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Covering graphs with few complete bipartite subgraphs
scientific article

    Statements

    title
    Covering graphs with few complete bipartite subgraphs (English)
    0 references
    author
    Herbert Fleischner
    0 references
    Egbert Mujuni
    0 references
    Daniël Paulusma
    0 references
    Stefan Szeider
    0 references
    publication date
    28 May 2009
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C70
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5558987
    0 references
    zbMATH Keywords
    bicliques
    0 references
    parameterized complexity
    0 references
    covering and partitioning problems
    0 references
    OpenAlex ID
    W2166502815
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1019181&oldid=35109101"
    Powered by MediaWiki