Outpaths of Arcs in Regular 3-Partite Tournaments

Abstract

Guo [Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math. 95 (1999) 273–277] proposed the concept of the outpath in digraphs. An outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting at x (an arc xy, respectively) such that x does not dominate the end vertex of this directed path. A k-outpath is an outpath of length k. The outpath is a generalization of the directed cycle. A c-partite tournament is an orientation of a complete c-partite graph.

Keywords

• multipartite tournament
• regular 3-partite tournament
• out-paths
• 05c20
• 05c38