On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\) (Q1617015): 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 multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / 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: Multipartite tournaments: a survey / rank
 
Normal rank

Latest revision as of 06:33, 17 July 2024

scientific article
Language Label Description Also known as
English
On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
scientific article

    Statements

    On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    multipartite tournaments
    0 references
    tournaments
    0 references
    cycles
    0 references

    Identifiers