Unique intersectability of diamond-free graphs (Q534340): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Uniquely intersectable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniquely intersectable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of representation of graphs by set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur deux propriétés des classes d'ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749328 / rank
 
Normal rank

Latest revision as of 01:12, 4 July 2024

scientific article
Language Label Description Also known as
English
Unique intersectability of diamond-free graphs
scientific article

    Statements

    Unique intersectability of diamond-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    set representation
    0 references
    uniquely intersectable
    0 references
    clique partition
    0 references
    diamond-free graphs
    0 references

    Identifiers