About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Journal article

Ádám's conjecture

From

Department of Applied Mathematics and Computer Science, Technical University of Denmark1

Algorithms, Logic and Graphs, Department of Applied Mathematics and Computer Science, Technical University of Denmark2

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.

Language: English
Year: 2023
Pages: 15-20
ISSN: 10960902 and 00958956
Types: Journal article
DOI: 10.1016/j.jctb.2023.01.005
ORCIDs: Thomassen, Carsten

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Open Access from: 06-02-2025

Analysis