Counterexamples to Adám's conjecture on arc reversals in directed graphs

DOI10.1016/0095-8956(87)90068-2zbMath0609.05041OpenAlexW1983352634MaRDI QIDQ1086583

Carsten Thomassen

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90068-2

zbMATH Keywords

directed graphsarc reversalsAdám's conjecturelongest directed cyclenumber of directed cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Arc reversals in tournaments ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Ádám's conjecture ⋮ Model and methods to address urban road network problems with disruptions ⋮ On arc reversal in balanced digraphs ⋮ Some remarks on Ádám's conjecture for simple directed graphs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments

Cites Work

• When the cartesian product of two directed cycles is hypo-Hamiltonian
• Cycles in digraphs– a survey
• Bemerkungen zum graphentheoretischen Satze von I. Fidrich
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counterexamples to Adám's conjecture on arc reversals in directed graphs