Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs

DOI10.1016/j.orl.2014.06.004zbMath1408.90302OpenAlexW2088469102MaRDI QIDQ1785251

Ngo Dac Tan

Publication date: 28 September 2018

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

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

zbMATH Keywords

minimum outdegreevertex disjoint cycles$d$-arc-dominated digraph$d$-regular digraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

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 ⋮ Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint cycles with different length in 4-arc-dominated digraphs
• 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

This page was built for publication: Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs