When n-cycles in n-partite tournaments are longest cycles. / Gutin, Gregory; Rafiey, A.

In: Discrete Mathematics, Vol. 289, No. 1-3, 2004, p. 163-168.

Research output: Contribution to journalArticlepeer-review

Published

Standard

When n-cycles in n-partite tournaments are longest cycles. / Gutin, Gregory; Rafiey, A.

In: Discrete Mathematics, Vol. 289, No. 1-3, 2004, p. 163-168.

Research output: Contribution to journalArticlepeer-review

Harvard

Gutin, G & Rafiey, A 2004, 'When n-cycles in n-partite tournaments are longest cycles.', Discrete Mathematics, vol. 289, no. 1-3, pp. 163-168. https://doi.org/10.1016/j.disc.2004.10.007

APA

Vancouver

Author

Gutin, Gregory ; Rafiey, A. / When n-cycles in n-partite tournaments are longest cycles. In: Discrete Mathematics. 2004 ; Vol. 289, No. 1-3. pp. 163-168.

BibTeX

@article{ede606576b2a425eb729e44723807c9a,
title = "When n-cycles in n-partite tournaments are longest cycles.",
keywords = "n-partite tournament, n-cycle",
author = "Gregory Gutin and A. Rafiey",
year = "2004",
doi = "10.1016/j.disc.2004.10.007",
language = "English",
volume = "289",
pages = "163--168",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

RIS

TY - JOUR

T1 - When n-cycles in n-partite tournaments are longest cycles.

AU - Gutin, Gregory

AU - Rafiey, A.

PY - 2004

Y1 - 2004

KW - n-partite tournament

KW - n-cycle

U2 - 10.1016/j.disc.2004.10.007

DO - 10.1016/j.disc.2004.10.007

M3 - Article

VL - 289

SP - 163

EP - 168

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -