Cycles in a tournament with pairwise zero, one or two given vertices in common (Q2470442): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning vertices of a tournament into independent cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-connected tournaments / rank
 
Normal rank

Latest revision as of 16:54, 27 June 2024

scientific article
Language Label Description Also known as
English
Cycles in a tournament with pairwise zero, one or two given vertices in common
scientific article

    Statements

    Cycles in a tournament with pairwise zero, one or two given vertices in common (English)
    0 references
    14 February 2008
    0 references
    0 references
    connected tournament
    0 references
    disjoint cycles
    0 references
    diameter
    0 references
    0 references