A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. / Bang-Jensen, J.; Gutin, Gregory; Yeo, Anders.

In: Journal of Graph Theory, Vol. 29, No. 2, 1998, p. 111-132.

Research output: Contribution to journalArticlepeer-review

Published

Standard

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. / Bang-Jensen, J.; Gutin, Gregory; Yeo, Anders.

In: Journal of Graph Theory, Vol. 29, No. 2, 1998, p. 111-132.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Author

Bang-Jensen, J. ; Gutin, Gregory ; Yeo, Anders. / A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. In: Journal of Graph Theory. 1998 ; Vol. 29, No. 2. pp. 111-132.

BibTeX

@article{8c6b2f87e8cc4bfeac52bb8780f32a81,
title = "A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs",
keywords = "Hamiltonian cycle, polynomial algorithm, semicomplete multipartite digraph, multipartite tournament, cycle through specified vertices",
author = "J. Bang-Jensen and Gregory Gutin and Anders Yeo",
year = "1998",
doi = "10.1002/(SICI)1097-0118(199810)29:2<111::AID-JGT7>3.0.CO;2-U",
language = "English",
volume = "29",
pages = "111--132",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

AU - Bang-Jensen, J.

AU - Gutin, Gregory

AU - Yeo, Anders

PY - 1998

Y1 - 1998

KW - Hamiltonian cycle

KW - polynomial algorithm

KW - semicomplete multipartite digraph

KW - multipartite tournament

KW - cycle through specified vertices

U2 - 10.1002/(SICI)1097-0118(199810)29:2<111::AID-JGT7>3.0.CO;2-U

DO - 10.1002/(SICI)1097-0118(199810)29:2<111::AID-JGT7>3.0.CO;2-U

M3 - Article

VL - 29

SP - 111

EP - 132

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -