Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
type: Item
instance of: scholarly article
title: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
zbMATH Open document ID: 0943.05040
DOI: 10.1016/S0012-365X(99)00211-3
author: Yubao Guo
author: Meike Tewes
author: Lutz Volkmann
author: A. Yeo
published in: Discrete Mathematics
publication date: 2000-09-05T00:00:00Z
review text: A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of mutually opposite arcs. While in 1984 the reviewer characterized Hamiltonian semicomplete bipartite digraphs, no such characterization is known for semicomplete multipartite digraphs. The authors prove an interesting sufficient condition for Hamiltonicity of semicomplete multipartite digraphs.
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1420216
zbMATH Keywords: semicomplete multipartite digraph
zbMATH Keywords: Hamiltonicity
MaRDI profile type: Publication
Wikidata QID: Q127349476
description: scientific article; zbMATH DE number 1420216