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

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
Normal rank
 
Property / author
 
Property / author: Gregory Gutin / rank
Normal rank
 

Revision as of 02:10, 10 February 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
    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