On cycles containing a given arc in regular multipartite tournaments
type: Item
instance of: scholarly article
title: On cycles containing a given arc in regular multipartite tournaments
zbMATH Open document ID: 1054.05046
publication date: 2004-11-25T00:00:00Z
review text: The authors prove that every arc of a regular \(n\)-partite tournament, \(n\geq 4\), lies in a directed cycle containing vertices from exactly \(k\) parts for \(k=4,5,\dots,n\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 2119054
zbMATH Keywords: regular multipartite tournaments
zbMATH Keywords: directed cycles
author: Linqiang Pan
author: Keming Zhang
reviewed by: Brian Alspach
MaRDI profile type: Publication
full work available at URL: s10114-004-0327-1
OpenAlex ID: W2045298204
cites work: Q3097395
cites work: On Subtournaments of a Tournament
cites work: Cycles of Each Length in Regular Tournaments
cites work: Q4873829
cites work: Cycles in multipartite tournaments
cites work: Outpaths in semicomplete multipartite digraphs
cites work: On cycles in multipartite tournaments
cites work: Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
cites work: Cycles in multipartite tournaments: Results and problems
cites work: Cycles containing a given arc in regular multipartite tournaments
DOI: 10.1007/S10114-004-0327-1
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 2119054