Hamiltonian dicycles avoiding prescribed arcs in tournaments
type: Item
instance of: scholarly article
title: Hamiltonian dicycles avoiding prescribed arcs in tournaments
zbMATH Open document ID: 0622.05028
DOI: 10.1007/BF01788546
author: Pierre Fraisse
author: Carsten Thomassen
published in: Graphs and Combinatorics
publication date: 1987-01-01T00:00:00Z
review text: The main result of this paper is the following theorem: If T is a k- connected tournament and I a set of k-1 arcs of T, then T-I has a Hamiltonian directed cycle. This result was conjectured by the second author in a previous paper [Proc. Lond. Math. Soc., III. Ser. 45, 151-168 (1982; Zbl 0486.05049)].
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 4008421
zbMATH Keywords: Hamiltonian dicycle
zbMATH Keywords: k-connectedness
zbMATH Keywords: Camion's theorem
zbMATH Keywords: tournament
reviewed by: Ioan Tomescu
MaRDI profile type: Publication
cites work: Q3267901
cites work: Hamiltonian-connected tournaments
cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
full work available at URL: https://doi.org/10.1007/bf01788546
OpenAlex ID: W2048972313
description: scientific article; zbMATH DE number 4008421