Pages that link to "Item:Q960967"
From MaRDI portal
The following pages link to Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967):
Displayed 19 items.
- Vertex-disjoint cycles in regular tournaments (Q427838) (← links)
- The solution and applications of a combinatorial problem (Q427911) (← links)
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz (Q666527) (← links)
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree (Q708429) (← links)
- What is on his mind? (Q709300) (← links)
- An improved bound for disjoint directed cycles (Q1637139) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- Vertex disjoint 4-cycles in bipartite tournaments (Q1699558) (← links)
- On the number of disjoint 4-cycles in regular tournaments (Q1708396) (← links)
- Vertex-disjoint cycles in local tournaments (Q2005720) (← links)
- Lichiardopol's conjecture on disjoint cycles in tournaments (Q2188844) (← links)
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments (Q2333161) (← links)
- Disjoint cycles with different length in 4-arc-dominated digraphs (Q2450750) (← links)
- On the Number of Vertex-Disjoint Cycles in Digraphs (Q5205389) (← links)
- Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments (Q5417823) (← links)
- Vertex-disjoint cycles in bipartite tournaments (Q5892296) (← links)
- Vertex-disjoint cycles in bipartite tournaments (Q5919730) (← links)
- Two disjoint cycles in digraphs (Q6081571) (← links)
- Disjoint cycles in tournaments and bipartite tournaments (Q6143388) (← links)