Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962899930 / rank
 
Normal rank

Revision as of 20:12, 19 March 2024

scientific article; zbMATH DE number 6588480
Language Label Description Also known as
English
Tight lower bounds on the number of bicliques in false-twin-free graphs
scientific article; zbMATH DE number 6588480

    Statements

    Tight lower bounds on the number of bicliques in false-twin-free graphs (English)
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    bicliques
    0 references
    false-twin-free graphs
    0 references
    lower bounds
    0 references

    Identifiers