Diregular c-partite tournaments are vertex-pancyclic when c>=5. / Yeo, Anders.
In: Journal of Graph Theory, Vol. 32, 1999, p. 137-152.Research output: Contribution to journal › Article › peer-review
Published
Standard
Diregular c-partite tournaments are vertex-pancyclic when c>=5. / Yeo, Anders.
In: Journal of Graph Theory, Vol. 32, 1999, p. 137-152.Research output: Contribution to journal › Article › peer-review
Harvard
Yeo, A 1999, 'Diregular c-partite tournaments are vertex-pancyclic when c>=5', Journal of Graph Theory, vol. 32, pp. 137-152.
APA
Yeo, A. (1999). Diregular c-partite tournaments are vertex-pancyclic when c>=5. Journal of Graph Theory, 32, 137-152.
Vancouver
Yeo A. Diregular c-partite tournaments are vertex-pancyclic when c>=5. Journal of Graph Theory. 1999;32:137-152.
Author
BibTeX
@article{9fa9ef4bd3774191a908ab0280eef328,
title = "Diregular c-partite tournaments are vertex-pancyclic when c>=5",
author = "Anders Yeo",
year = "1999",
language = "Undefined/Unknown",
volume = "32",
pages = "137--152",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
}
RIS
TY - JOUR
T1 - Diregular c-partite tournaments are vertex-pancyclic when c>=5
AU - Yeo, Anders
PY - 1999
Y1 - 1999
M3 - Article
VL - 32
SP - 137
EP - 152
JO - Journal of Graph Theory
JF - Journal of Graph Theory
SN - 0364-9024
ER -