Premium
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
Author(s) -
Gutin G.
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190190405
Subject(s) - digraph , multipartite , mathematics , combinatorics , arc (geometry) , graph , directed graph , enhanced data rates for gsm evolution , discrete mathematics , algorithm , computer science , artificial intelligence , geometry , physics , quantum , quantum mechanics , quantum entanglement
A digraph obtained by replacing each edge of a complete m ‐partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is calied a semicomplete m ‐partite digraph. We describe results (theorems and algorithms) on directed walks in semicomplete m ‐partite digraphs, including some recent results concerning tournaments. © 1995 John Wiley & Sons, Inc.