On the vertices of a 3-partite tournament not in triangles (Q2352064): 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 number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic / 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: Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215944 / rank
 
Normal rank

Latest revision as of 10:14, 10 July 2024

scientific article
Language Label Description Also known as
English
On the vertices of a 3-partite tournament not in triangles
scientific article

    Statements

    On the vertices of a 3-partite tournament not in triangles (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2015
    0 references
    tripartite tournaments
    0 references
    \(\vec {C_3}\)-free vertices
    0 references
    global irregularity
    0 references

    Identifiers