How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
type: Item
instance of: scholarly article
title: How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
zbMATH Open document ID: 0939.05059
author: A. Yeo
published in: Graphs and Combinatorics
publication date: 2000-07-05T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1394580
zbMATH Keywords: semicomplete multipartite digraph
zbMATH Keywords: irregularity
zbMATH Keywords: Hamiltonian
zbMATH Keywords: tournaments
MaRDI profile type: Publication
full work available at URL: s003730050080
OpenAlex ID: W2109790328
DOI: 10.1007/S003730050080
description: scientific article; zbMATH DE number 1394580