The (1,2)-step competition graph of a tournament (Q617643): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(m\)-step competition graph of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of competition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((i,j)\) competition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected triangle-free \(m\)-step competition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The competition numbers of complete tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3479858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171826 / rank
 
Normal rank

Latest revision as of 17:17, 3 July 2024

scientific article
Language Label Description Also known as
English
The (1,2)-step competition graph of a tournament
scientific article

    Statements

    The (1,2)-step competition graph of a tournament (English)
    0 references
    0 references
    0 references
    21 January 2011
    0 references
    0 references
    competition graph
    0 references
    tournament
    0 references
    digraph
    0 references
    \(m\)-step graph
    0 references
    0 references