Extending cycles in directed graphs
type: Item
instance of: scholarly article
title: Extending cycles in directed graphs
zbMATH Open document ID: 0626.05022
DOI: 10.1016/0095-8956(89)90042-7
author: George R. T. Hendy
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
review text: A digraph D is called cycle extendable if it contains at least one cycle and the vertices of each nonhamiltonian cycle are contained in a cycle of length one greater. Strong tournaments and regular tournaments which are cycle extendable are characterized. Best possible sufficient conditions for a digraph to be cycle extendable are found involving the number of arcs, minimum total degree and minimum indegree and outdegree.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4016927
zbMATH Keywords: digraph
zbMATH Keywords: cycle extendable
zbMATH Keywords: strong tournaments
zbMATH Keywords: regular tournaments
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90042-7
OpenAlex ID: W2087401575
cites work: Cycles of Each Length in Regular Tournaments
cites work: Q3941433
cites work: Q3818315
cites work: Some Theorems on Abstract Graphs
cites work: Q3266934
cites work: Extending cycles in graphs
cites work: On maximal circuits in directed graphs
cites work: On Subtournaments of a Tournament
cites work: Q5576243
Recommended article: Extending cycles in graphs
Recommended article: Cycle extendability in graphs and digraphs
Recommended article: Extending cycles in bipartite graphs
Recommended article: On cycles of directed graphs
Recommended article: Edge cycle extendable graphs
Recommended article: Q3166118
Recommended article: Extension of paths and cycles for hypergraphs
Recommended article: Cycle extension in edge-colored complete graphs
Recommended article: Cycle lengths in expanding graphs
Recommended article: Extending vertex and edge pancyclic graphs
description: scientific article; zbMATH DE number 4016927