1995•Journal of Graph TheoryRequires access

Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey

Gregory Gutin

Abstract

Abstract 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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 65 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Digraph, Multipartite, Mathematics, Combinatorics, Arc (geometry), Graph, Directed graph, Enhanced Data Rates for GSM Evolution