A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039999 / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Longest Path in a Complete Multipartite Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325297 / 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 and paths in bipartite tournaments with spanning configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding Hamiltonian cycles in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4333459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826603 / rank
 
Normal rank

Latest revision as of 14:08, 27 May 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
scientific article

    Statements

    A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (English)
    0 references
    0 references
    0 references
    0 references
    17 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    multipartite tournament
    0 references
    digraph
    0 references
    factor
    0 references
    Hamiltonian
    0 references
    paths
    0 references
    cycles
    0 references