Extending cycles in directed graphs (Q580359): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(89)90042-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087401575 / rank | |||
Normal rank | |||
Revision as of 02:10, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extending cycles in directed graphs |
scientific article |
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
