The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments (Q708413): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extendable cycles in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in multipartite tournaments: Results and problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipartite tournaments: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diregularc-partite tournaments are vertex-pancyclic whenc ? 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215944 / rank
 
Normal rank

Latest revision as of 08:15, 3 July 2024

scientific article
Language Label Description Also known as
English
The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments
scientific article

    Statements

    The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    directed triangle free vertex
    0 references
    regular 3-partite tournament
    0 references
    0 references