Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
type: Item
instance of: scholarly article
title: Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
zbMATH Open document ID: 1050.05061
author: Lutz Volkmann
author: A. Yeo
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
review text: A multipartite tournament is an orientation of a complete multipartite graph. The authors prove a sufficient condition for a multipartite tournament to contain a Hamiltom path starting with a given path. As a corollary, they show that every arc of a regular multipartite tournament is contained in a Hamilton path. They conjecture that every arc of a regular \(c\)-partite tournament is contained in a Hamilton cycle for each \(c\geq 4.\)
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2083675
zbMATH Keywords: multipartite tournament
zbMATH Keywords: Hamilton path
zbMATH Keywords: regular
MaRDI profile type: Publication
full work available at URL: j.disc.2003.07.013
OpenAlex ID: W2017888452
cites work: Cycles and paths of many lengths in bipartite digraphs
cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
cites work: Q4756732
cites work: Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
cites work: Q3999465
cites work: Cycles in multipartite tournaments: Results and problems
cites work: Q4000792
cites work: One-diregular subgraphs in semicomplete multipartite digraphs
cites work: Kings in semicomplete multipartite digraphs
cites work: How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
cites work: Paths and cycles containing given arcs, in close to regular multipartite tournaments
DOI: 10.1016/J.DISC.2003.07.013
description: scientific article; zbMATH DE number 2083675