Highly linked tournaments
type: Item
instance of: scholarly article
title: Highly linked tournaments
zbMATH Open document ID: 1319.05063
author: Alexey Pokrovskiy
published in: Journal of Combinatorial Theory. Series B
publication date: 2015-08-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1406.7552
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6474984
zbMATH Keywords: connectivity of tournaments
zbMATH Keywords: linkedness
zbMATH Keywords: linkage structures
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W433207136
arXiv ID: 1406.7552
cites work: Sorting in \(c \log n\) parallel steps
cites work: Q3815328
cites work: Highly linked graphs
cites work: Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
cites work: Bipartitions of highly connected tournaments
cites work: Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen
cites work: An improved linear edge bound for graph linkages
cites work: Q3337490
cites work: Highly connected non-2-linked digraphs
DOI: 10.1016/J.JCTB.2015.05.005
description: scientific article