Competition polysemy (Q1827753): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q29028307, #quickstatements; #temporary_batch_1712111774907
Created claim: DBLP publication ID (P1635): journals/dm/FischermannKKR04, #quickstatements; #temporary_batch_1731483406851
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A characterization of competition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs of competition number m / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of competition graphs of arbitrary digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The competition-common enemy graph of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound graph polysemy / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/FischermannKKR04 / rank
 
Normal rank

Latest revision as of 08:56, 13 November 2024

scientific article
Language Label Description Also known as
English
Competition polysemy
scientific article

    Statements

    Competition polysemy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Competition graph
    0 references
    Common enemy graph
    0 references
    Clique
    0 references
    Polysemic pair
    0 references

    Identifiers