An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic
type: Item
instance of: scholarly article
title: An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic
zbMATH Open document ID: 1112.05047
author: Jinfeng Feng
author: Shengjia Li
author: Ruijuan Li
published in: Discrete Applied Mathematics
publication date: 2007-01-09T00:00:00Z
review text: Let \(T\) be an \(s\)-strong tournament with \(n\) vertices where \(s\geq 3\). The authors show that \(T\) contains at least \(s+1\) vertices \(v\) such that each arc leading away from \(v\) belongs to cycles of lengths \(4,5,\dots, n\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5082764
zbMATH Keywords: cycle
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: j.dam.2006.04.022
OpenAlex ID: W1999734424
cites work: Q3267901
cites work: Cycles in k-strong tournaments
cites work: The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
cites work: Hamiltonian-connected tournaments
cites work: Pancyclic out-arcs of a vertex in tournaments
cites work: The number of pancyclic arcs in a k‐strong tournament
DOI: 10.1016/J.DAM.2006.04.022
description: scientific article; zbMATH DE number 5082764