Spanning local tournaments in locally semicomplete digraphs
type: Item
instance of: scholarly article
title: Spanning local tournaments in locally semicomplete digraphs
zbMATH Open document ID: 0884.05047
DOI: 10.1016/S0166-218X(97)00037-1
author: Yubao Guo
published in: Discrete Applied Mathematics
publication date: 1997-11-18T00:00:00Z
full work available at URL: dam
review text: A subgraph of a graph is a spanning subgraph if it contains all the vertices of the graph. A digraph is semicomplete if there is at least one arc between any two different vertices. The author proves that every \(3k-2\) connected locally semicomplete digraph contains a \(k\) connected spanning local tournament.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1088858
zbMATH Keywords: digraph
zbMATH Keywords: connected spanning local tournament
reviewed by: David P. Brown
MaRDI profile type: Publication
cites work: Locally semicomplete digraphs: A generalization of tournaments
cites work: Q4851597
cites work: Connectivity properties of locally semicomplete digraphs
OpenAlex ID: W2012133501
description: scientific article; zbMATH DE number 1088858