On 3-regular digraphs without vertex disjoint cycles of different lengths

DOI10.1016/j.disc.2017.03.024zbMath1362.05055OpenAlexW2609623909MaRDI QIDQ2397536

Ngo Dac Tan

Publication date: 22 May 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.024

zbMATH Keywords

girthvertex disjoint cycles3-regular digraphcycles of different lengths

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

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

• Graphs and digraphs with all 2-factors isomorphic
• On vertex disjoint cycles of different lengths in 3-regular digraphs
• Vertex Disjoint Cycles of Different Length in Digraphs
• Unnamed Item

This page was built for publication: On 3-regular digraphs without vertex disjoint cycles of different lengths