When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968553077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of tournaments: A survey / 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: On cycles through a given vertex in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826582 / 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: Longest paths in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in multipartite tournaments: Results and problems / rank
 
Normal rank

Latest revision as of 18:22, 7 June 2024

scientific article
Language Label Description Also known as
English
When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
scientific article

    Statements