On covering graphs by complete bipartite subgraphs (Q1025967)

From MaRDI portal
Revision as of 02:52, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On covering graphs by complete bipartite subgraphs
scientific article

    Statements

    On covering graphs by complete bipartite subgraphs (English)
    0 references
    23 June 2009
    0 references
    0 references
    edge clique covering number
    0 references
    biclique
    0 references
    fractional covers
    0 references
    Boolean functions
    0 references
    communication complexity
    0 references
    0 references
    0 references
    0 references