Pages that link to "Item:Q1684653"
From MaRDI portal
The following pages link to Disjoint cycles of different lengths in graphs and digraphs (Q1684653):
Displaying 16 items.
- Vertex-disjoint rainbow triangles in edge-colored graphs (Q2005705) (← links)
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments (Q2008499) (← links)
- Majority colorings of sparse digraphs (Q2030755) (← links)
- Vertex-disjoint cycles of different lengths in multipartite tournaments (Q2124611) (← links)
- Lichiardopol's conjecture on disjoint cycles in tournaments (Q2188844) (← links)
- On the problem of finding disjoint cycles and dicycles in a digraph (Q2428634) (← links)
- Partition and disjoint cycles in digraphs (Q2698538) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree (Q5084095) (← links)
- Disjoint Chorded Cycles of the Same Length (Q5256526) (← links)
- Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths (Q5857005) (← links)
- Properly colored cycles of different lengths in edge-colored complete graphs (Q6056740) (← links)
- Two disjoint cycles in digraphs (Q6081571) (← links)
- Vertex‐disjoint cycles of the same length in tournaments (Q6094042) (← links)
- Vertex-disjoint cycles of different lengths in local tournaments (Q6133661) (← links)
- Disjoint cycles in tournaments and bipartite tournaments (Q6143388) (← links)
