Extending cycles in directed graphs (Q580359): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / 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. | |||
| Property / 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4016927 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
digraph | |||
| Property / zbMATH Keywords: digraph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle extendable | |||
| Property / zbMATH Keywords: cycle extendable / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strong tournaments | |||
| Property / zbMATH Keywords: strong tournaments / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
regular tournaments | |||
| Property / zbMATH Keywords: regular tournaments / rank | |||
Normal rank | |||
Revision as of 17:38, 1 July 2023
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
