Two disjoint cycles in digraphs

DOI10.1002/jgt.22972zbMath1522.05229arXiv2205.10826OpenAlexW4366828361MaRDI QIDQ6081571

Unnamed Author, Christian Reiher, Joanna Polcyn

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.10826

zbMATH Keywords

cyclesdigraphsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Disjoint cycles in digraphs
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Disjoint directed cycles
• On Hamilton's ideals
• Two proofs of Bermond-Thomassen conjecture for regular tournaments
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• On the maximal number of independent circuits in a graph

This page was built for publication: Two disjoint cycles in digraphs