Disjoint cycles with different length in 4-arc-dominated digraphs

DOI10.1016/j.orl.2013.09.003zbMath1287.05050OpenAlexW2010650676MaRDI QIDQ2450750

Ding Ma, Yun Shu Gao

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.09.003

zbMATH Keywords

digraphsvertex-disjoint cyclesminimum out-degree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Vertex-disjoint cycles of different lengths in multipartite tournaments ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ Vertex-disjoint cycles of different lengths in local tournaments ⋮ On 3-regular digraphs of girth 4 ⋮ Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs ⋮ Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths

Cites Work

• Disjoint cycles in digraphs
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Disjoint directed cycles
• Research problems from the 20th British Combinatorial Conference
• Vertex Disjoint Cycles of Different Length in Digraphs
• 3-Arc-Dominated Digraphs
• 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

This page was built for publication: Disjoint cycles with different length in 4-arc-dominated digraphs