Weakly Hamiltonian-connected ordinary multipartite tournaments
type: Item
instance of: scholarly article
title: Weakly Hamiltonian-connected ordinary multipartite tournaments
zbMATH Open document ID: 0834.05027
DOI: 10.1016/0012-365X(94)00188-O
author: G. Gutin
author: Jing Huang
author: Jørgen Bang-Jensen
published in: Discrete Mathematics
publication date: 1996-03-10T00:00:00Z
review text: An ordinary multipartite tournament is an orientation of a complete \(k\)- partite graph such that, for any two partite classes, all arcs between them have the same direction. The authors characterize completely those ordinary multipartite tournaments which contain two vertices that are not connected by a directed Hamilton path.
reviewed by: Carsten Thomassen
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 743997
zbMATH Keywords: multipartite tournament
zbMATH Keywords: Hamilton path
MaRDI profile type: Publication
cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
cites work: Locally semicomplete digraphs: A generalization of tournaments
cites work: On the structure of locally semicomplete digraphs
cites work: A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
cites work: Quasi‐transitive digraphs
cites work: Kings in quasi-transitive digraphs
cites work: Weakly hamiltonian-connected vertices in bipartite tournaments
cites work: Q3291037
cites work: Q4325297
cites work: Finding a Longest Path in a Complete Multipartite Digraph
cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
cites work: On the structure of local tournaments
cites work: Hamiltonian-connected tournaments
full work available at URL: 0012-365x(94)00188-o
OpenAlex ID: W2046516849
Recommended article: Weakly quasi-Hamiltonian-connected multipartite tournaments
Recommended article: Weakly quasi-Hamiltonian-set-connected multipartite tournaments
Recommended article: Weakly hamiltonian-connected vertices in bipartite tournaments
Recommended article: Q3984860
Recommended article: Q4848021
Recommended article: Q4826284
Recommended article: Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments
Recommended article: Q3595115
Recommended article: Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
Recommended article: On the connectivity of close to regular multipartite tournaments
description: scientific article; zbMATH DE number 743997