Extending cycles in directed graphs (Q580359): Difference between revisions

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

zbMATH Keywords

digraph

0 references

cycle extendable

0 references

strong tournaments

0 references

regular tournaments

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0095-8956(89)90042-7

0 references

cites work

Cycles of Each Length in Regular Tournaments

0 references

Q3941433

0 references

Q3818315

0 references

Some Theorems on Abstract Graphs

0 references

Q3266934

0 references

Extending cycles in graphs

0 references

On maximal circuits in directed graphs

0 references

On Subtournaments of a Tournament

0 references

Q5576243

0 references

Identifiers

zbMATH Open document ID

0626.05022

0 references

DOI

10.1016/0095-8956(89)90042-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:580359

@@ 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.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+4016927
@@ 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
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(89)90042-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2087401575
@@ Property / OpenAlex ID: W2087401575 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles of Each Length in Regular Tournaments
@@ Property / cites work: Cycles of Each Length in Regular Tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818315
@@ Property / cites work: Q3818315 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3266934
@@ Property / cites work: Q3266934 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending cycles in graphs
@@ Property / cites work: Extending cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal circuits in directed graphs
@@ Property / cites work: On maximal circuits in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Subtournaments of a Tournament
@@ Property / cites work: On Subtournaments of a Tournament / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576243
@@ Property / cites work: Q5576243 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:580359