The following pages link to Stefan Winzen (Q998430):
Displayed 20 items.
- Strong subtournaments containing a given vertex in regular multipartite tournaments (Q998431) (← links)
- Every cycle-connected multipartite tournament has a universal arc (Q1011750) (← links)
- Complementary cycles in regular multipartite tournaments, where one cycle has length five (Q1025933) (← links)
- Cycles through a given arc and certain partite sets in almost regular multipartite tournaments (Q1827790) (← links)
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc (Q1877670) (← links)
- Paths with a given number of vertices from each partite set in regular multipartite tournaments (Q2433729) (← links)
- Strongly 4-path-connectivity in almost regular multipartite tournaments (Q2463909) (← links)
- Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\) (Q2477396) (← links)
- On the connectivity of close to regular multipartite tournaments (Q2492221) (← links)
- (Q3070297) (← links)
- Weakly Complementary Cycles in 3-Connected Multipartite Tournaments (Q3526473) (← links)
- (Q3567495) (← links)
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911) (← links)
- (Q4405652) (← links)
- (Q4659586) (← links)
- (Q4818783) (← links)
- (Q4826284) (← links)
- CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS (Q5421168) (← links)
- (Q5449169) (← links)
- (Q5702646) (← links)