Ádám's conjecture

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

We describe an infinite family of strongly 2-connected oriented graphs (that is, directed graphs with no multiple arcs) containing no arc whose reversal decreases the number of directed cycles.
Original languageEnglish
JournalJournal of Combinatorial Theory. Series B
Volume161
Pages (from-to)15-20
ISSN0095-8956
DOIs
Publication statusPublished - 2023

Keywords

  • Arc reversals
  • Directed cycles
  • Oriented graphs

Fingerprint

Dive into the research topics of 'Ádám's conjecture'. Together they form a unique fingerprint.

Cite this