On the Number of Vertex-Disjoint Cycles in Digraphs

DOI10.1137/18M1186356zbMath1429.05080arXiv1805.02999OpenAlexW2995591345WikidataQ126584338 ScholiaQ126584338MaRDI QIDQ5205389

Yannis Manoussakis, Yan Dong Bai

Publication date: 11 December 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

girthvertex-disjoint cycleslongest pathminimum outdegreeBermond-Thomassen conjecture

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On disjoint cycles of the same length in tournaments ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Partition and disjoint cycles in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-disjoint directed and undirected cycles in general digraphs
• Disjoint cycles in digraphs
• Packing directed circuits exactly
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• On digraphs with no two disjoint directed cycles
• Disjoint directed cycles
• Packing directed circuits
• On the problem of finding disjoint cycles and dicycles in a digraph
• Vertex Disjoint Cycles of Different Length in Digraphs
• Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
• Vertex-disjoint cycles in bipartite tournaments

This page was built for publication: On the Number of Vertex-Disjoint Cycles in Digraphs