Vertex Disjoint Cycles of Different Length in Digraphs

DOI10.1137/100802463zbMath1248.05079OpenAlexW2058803450MaRDI QIDQ2910944

Michael A. Henning, Anders Yeo

Publication date: 12 September 2012

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

Full work available at URL: https://doi.org/10.1137/100802463

zbMATH Keywords

3-regular bipartite digraphs

Mathematics Subject Classification ID

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

Related Items (18)

Disjoint cycles of different lengths in 3-regular digraphs ⋮ Vertex-disjoint cycles of different lengths in multipartite tournaments ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ On 3-regular digraphs without vertex disjoint cycles of different lengths ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ On 2-Colorings of Hypergraphs ⋮ Disjoint cycles of different lengths in graphs and digraphs ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Vertex-disjoint cycles of different lengths in local tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Partition and disjoint cycles in digraphs ⋮ Disjoint cycles with different length in 4-arc-dominated digraphs ⋮ Vertex-disjoint rainbow triangles in edge-colored graphs ⋮ On 3-regular digraphs of girth 4 ⋮ Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ On vertex disjoint cycles of different lengths in 3-regular digraphs ⋮ Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths

This page was built for publication: Vertex Disjoint Cycles of Different Length in Digraphs