On 3-regular digraphs without vertex disjoint cycles of different lengths
From MaRDI portal
Publication:2397536
Recommendations
Cites work
Cited in
(11)- Disjoint cycles of different lengths in 3-regular digraphs
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- On 3-regular digraphs of girth 4
- On vertex disjoint cycles of different lengths in 3-regular digraphs
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- On 3-uniform hypergraphs without a cycle of a given length
- Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
- Vertex-disjoint cycles of different lengths in local tournaments
- Incomplete tournaments without disjoint cycles of different lengths
- A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths
- Extremal function of two independent chorded cycles in a bipartite graph
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)