A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
type: Item
instance of: scholarly article
title: A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
zbMATH Open document ID: 0870.05046
DOI: 10.1016/0012-365X(95)00272-X
author: Jing Huang
author: Jørgen Bang-Jensen
author: G. Gutin
published in: Discrete Mathematics
publication date: 1997-09-17T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1018468
zbMATH Keywords: multipartite tournament
zbMATH Keywords: digraph
zbMATH Keywords: factor
zbMATH Keywords: Hamiltonian
zbMATH Keywords: paths
zbMATH Keywords: cycles
MaRDI profile type: Publication
cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
cites work: Q3907592
cites work: Q4039999
cites work: Diconnected Orientations and a Conjecture of Las Vergnas
cites work: Q5422499
cites work: Q3744182
cites work: Q3828034
cites work: Finding a Longest Path in a Complete Multipartite Digraph
cites work: Q4325297
cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
cites work: Cycles and paths in bipartite tournaments with spanning configurations
cites work: A linear-time algorithm for finding Hamiltonian cycles in tournaments
cites work: Q5585195
cites work: One-diregular subgraphs in semicomplete multipartite digraphs
cites work: Q3826603
full work available at URL: 0012-365x(95)00272-x
OpenAlex ID: W2069552017
description: scientific article; zbMATH DE number 1018468