On cycles containing a given arc in regular multipartite tournaments (Q1887430): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of Each Length in Regular 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: Outpaths in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles in multipartite tournaments / 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: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey / 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: Cycles containing a given arc in regular multipartite tournaments / rank
 
Normal rank

Latest revision as of 16:26, 7 June 2024

scientific article
Language Label Description Also known as
English
On cycles containing a given arc in regular multipartite tournaments
scientific article

    Statements

    On cycles containing a given arc in regular multipartite tournaments (English)
    0 references
    25 November 2004
    0 references
    The authors prove that every arc of a regular \(n\)-partite tournament, \(n\geq 4\), lies in a directed cycle containing vertices from exactly \(k\) parts for \(k=4,5,\dots,n\).
    0 references
    0 references
    regular multipartite tournaments
    0 references
    directed cycles
    0 references
    0 references
    0 references
    0 references
    0 references