Almost regular multipartite tournaments containing a Hamiltonian path through a given arc (Q1877670): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-strong and \(k\)-cyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian / 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: Long paths and cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070297 / 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: Hamiltonian paths containing a given arc, in almost regular bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826284 / 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: One-diregular subgraphs in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kings 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: Q3826603 / rank
 
Normal rank

Latest revision as of 20:08, 6 June 2024

scientific article
Language Label Description Also known as
English
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
scientific article

    Statements

    Almost regular multipartite tournaments containing a Hamiltonian path through a given arc (English)
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    0 references
    multipartite tournaments
    0 references
    almost regular multipartite tournaments
    0 references
    Hamiltonian path
    0 references
    0 references