Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
type: Item
instance of: scholarly article
title: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
zbMATH Open document ID: 0839.05043
author: G. Gutin
published in: Journal of Graph Theory
publication date: 1996-06-18T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 786110
zbMATH Keywords: semicomplete multipartite digraph
zbMATH Keywords: extended semicomplete digraphs
zbMATH Keywords: independent set
zbMATH Keywords: semicomplete bipartite digraphs
zbMATH Keywords: survey
zbMATH Keywords: cycles
zbMATH Keywords: paths
zbMATH Keywords: factor
zbMATH Keywords: Hamiltonian
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: Hamiltonian cycle problem
MaRDI profile type: MaRDI publication profile
full work available at URL: jgt.3190190405
OpenAlex ID: W2143262036
cites work: Q3050437
cites work: Cycles of Each Length in Regular Tournaments
cites work: Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
cites work: Weakly hamiltonian-connected vertices in bipartite tournaments
cites work: Q3875955
cites work: Q3097395
cites work: The radii of n-partite tournaments
cites work: Q3826582
cites work: Q3353039
cites work: Q4739657
cites work: Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
DOI: 10.1002/JGT.3190190405
Recommended article: One-diregular subgraphs in semicomplete multipartite digraphs
Recommended article: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
Recommended article: Semicomplete Multipartite Digraphs
Recommended article: Q4262246
Recommended article: Quasi-hamiltonian paths in semicomplete multipartite digraphs
description: scientific article; zbMATH DE number 786110