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

DOI10.1016/J.DISC.2017.03.024zbMATH Open1362.05055OpenAlexW2609623909MaRDI QIDQ2397536FDOQ2397536

Authors: 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

Recommendations

• On 3-regular digraphs of girth 4
• On vertex disjoint cycles of different lengths in 3-regular digraphs
• Disjoint cycles of different lengths in 3-regular digraphs
• Vertex disjoint cycles of different length in digraphs
• On the number of vertex-disjoint cycles in digraphs

zbMATH Keywords

girthvertex disjoint cycles3-regular digraphcycles of different lengths

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graphs and digraphs with all 2-factors isomorphic
• Vertex disjoint cycles of different length in digraphs
• On vertex disjoint cycles of different lengths in 3-regular digraphs

Cited In (6)

• Vertex-disjoint cycles of different lengths in local tournaments
• On 3-regular digraphs of girth 4
• Vertex-disjoint cycles of different lengths in multipartite tournaments
• Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths
• On 3-uniform hypergraphs without a cycle of a given length
• Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397536)