Cycles of all lengths in arc-3-cyclic semicomplete digraphs
type: Item
instance of: scholarly article
title: Cycles of all lengths in arc-3-cyclic semicomplete digraphs
zbMATH Open document ID: 0880.05056
DOI: 10.1016/S0012-365X(96)00094-5
author: Marjorie Darrah
author: Yiping Liu
author: Cun-Quan Zhang
published in: Discrete Mathematics
publication date: 1998-01-06T00:00:00Z
review text: A digraph of order \(n\) is said to be arc-\(k\)-cyclic if every arc lies in a directed cycle of length \(k\). It is said to be arc-pancyclic if it is arc-\(k\)-cyclic for each \(k\in\{3,4,\ldots,n\}\). A digraph \(D\) is said to be a semicomplete digraph if for every pair of distinct vertices \(u\) and \(v\) in \(D\), at least one of \((u,v)\) or \((v,u)\) is an arc of \(D\). The authors study arc-\(k\)-cyclicity and arc-pancyclicity of semicomplete digraphs.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1062437
zbMATH Keywords: vertex-pancyclic
zbMATH Keywords: arc-pancyclic
zbMATH Keywords: tournament
zbMATH Keywords: digraph
reviewed by: Brian Alspach
MaRDI profile type: Publication
cites work: Cycles of Each Length in Regular Tournaments
cites work: Bypasses in asymmetric digraphs
cites work: Locally semicomplete digraphs: A generalization of tournaments
cites work: On the structure of locally semicomplete digraphs
cites work: Digraphs with the path‐merging property
cites work: A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
cites work: Tournaments That Admit Exactly One Hamiltonian Circuit
cites work: Q5545303
cites work: Q5576243
cites work: On Sets of Arcs Containing No Cycles in a Tournament*
cites work: Q4047560
cites work: Q3872493
cites work: Hamiltonian-connected tournaments
cites work: Cycles of each length in tournaments
description: scientific article; zbMATH DE number 1062437