CYCLES AND PATHS IN SEMICOMPLETE MULTIPARTITE DIGRAPHS, THEOREMS, ANDALGORITHMS - A SURVEY

Authors
GUTIN G
Citation
G. Gutin, CYCLES AND PATHS IN SEMICOMPLETE MULTIPARTITE DIGRAPHS, THEOREMS, ANDALGORITHMS - A SURVEY, Journal of graph theory, 19(4), 1995, pp. 481-505
Citations number
80
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
19
Issue
4
Year of publication
1995
Pages
481 - 505
Database
ISI
SICI code
0364-9024(1995)19:4<481:CAPISM>2.0.ZU;2-M
Abstract
A digraph obtained by replacing each edge of a complete m-partite grap h by an are or a pair of mutually opposite arcs with the same end vert ices is called a semicomplete m-partite digraph. We describe results ( theorems and algorithms) on directed walks in semicomplete m-partite d igraphs, including some recent results concerning tournaments. (C) 199 5 John Wiley & Sons, Inc.