Extending cycles in directed graphs (Q580359)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extending cycles in directed graphs |
scientific article; zbMATH DE number 4016927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extending cycles in directed graphs |
scientific article; zbMATH DE number 4016927 |
Statements
Extending cycles in directed graphs (English)
0 references
1989
0 references
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.
0 references
digraph
0 references
cycle extendable
0 references
strong tournaments
0 references
regular tournaments
0 references
0 references
0.9353435
0 references
0 references
0 references
0 references
0.89991707
0 references
0 references
0 references
0.8913918
0 references
