Hamiltonian-connected tournaments
type: Item
instance of: scholarly article
title: Hamiltonian-connected tournaments
zbMATH Open document ID: 0435.05026
DOI: 10.1016/0095-8956(80)90061-1
published in: Journal of Combinatorial Theory. Series B
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 3677864
zbMATH Keywords: paths
zbMATH Keywords: cycles
zbMATH Keywords: weakly Hamiltonian-connected
zbMATH Keywords: strongly panconnected
zbMATH Keywords: strongly Hamiltonian-connected
Wikidata QID: Q56503965
author: Carsten Thomassen
MaRDI profile type: Publication
full work available at URL: 0095-8956(80)90061-1
OpenAlex ID: W1991927950
cites work: Cycles of Each Length in Regular Tournaments
cites work: Bypasses in asymmetric digraphs
cites work: Q3266934
cites work: Cycles in k-strong tournaments
cites work: Q5572939
cites work: Q5577695
cites work: Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
cites work: Q5585195
cites work: Hamiltonian paths in oriented graphs
cites work: Q4756732
description: scientific article; zbMATH DE number 3677864