Covering graphs with few complete bipartite subgraphs (Q1019181): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:52, 30 January 2024

scientific article
Language Label Description Also known as
English
Covering graphs with few complete bipartite subgraphs
scientific article

    Statements

    Covering graphs with few complete bipartite subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    bicliques
    0 references
    parameterized complexity
    0 references
    covering and partitioning problems
    0 references