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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.07.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054453791 / rank
 
Normal rank
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