Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cycles in bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873829 / 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: Q4487469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / 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: Q4269443 / 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: All regular multipartite tournaments that are cycle complementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-diregular subgraphs in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344011 / rank
 
Normal rank

Latest revision as of 01:49, 29 June 2024

scientific article
Language Label Description Also known as
English
Cycles with a given number of vertices from each partite set in regular multipartite tournaments
scientific article

    Statements

    Cycles with a given number of vertices from each partite set in regular multipartite tournaments (English)
    0 references
    0 references
    0 references
    9 February 2009
    0 references
    0 references
    multipartite tournaments
    0 references
    regular multipartite tournaments
    0 references
    cycles
    0 references
    0 references