When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 18:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When \(n\)-cycles in \(n\)-partite tournaments are longest cycles |
scientific article |
Statements
When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (English)
0 references
22 February 2005
0 references
\(n\)-partite tournament
0 references
Longest cycles
0 references
Short cycles
0 references
