Counterexamples to Adám's conjecture on arc reversals in directed graphs (Q1086583)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3985258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counterexamples to Adám's conjecture on arc reversals in directed graphs |
scientific article; zbMATH DE number 3985258 |
Statements
Counterexamples to Adám's conjecture on arc reversals in directed graphs (English)
0 references
1987
0 references
The author defines an infinite class of directed graphs with the property that reversing any arc increases the length of a longest directed cycle. From this he obtains counterexamples to Adám's conjecture that any directed graph with at least one directed cycle contains an arc whose reversal decreases the total number of directed cycles.
0 references
arc reversals
0 references
directed graphs
0 references
longest directed cycle
0 references
Adám's conjecture
0 references
number of directed cycles
0 references
0.874354898929596
0 references
0.8546363711357117
0 references
