| 2008 |
|---|
| 8 | | Irene Stella,
Lutz Volkmann,
Stefan Winzen:
How close to regular must a multipartite tournament be to secure a given path covering number?
Ars Comb. 87: (2008) |
| 7 | EE | Lutz Volkmann,
Stefan Winzen:
Strong subtournaments containing a given vertex in regular multipartite tournaments.
Discrete Mathematics 308(23): 5516-5521 (2008) |
| 6 | EE | Lutz Volkmann,
Stefan Winzen:
Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5.
Discrete Mathematics 308(9): 1710-1721 (2008) |
| 2007 |
|---|
| 5 | EE | Irene Stella,
Lutz Volkmann,
Stefan Winzen:
Strongly 4-path-connectivity in almost regular multipartite tournaments.
Discrete Mathematics 307(24): 3213-3219 (2007) |
| 2006 |
|---|
| 4 | EE | Lutz Volkmann,
Stefan Winzen:
On the connectivity of close to regular multipartite tournaments.
Discrete Applied Mathematics 154(9): 1437-1452 (2006) |
| 3 | EE | Lutz Volkmann,
Stefan Winzen:
Paths with a given number of vertices from each partite set in regular multipartite tournaments.
Discrete Mathematics 306(21): 2724-2732 (2006) |
| 2004 |
|---|
| 2 | EE | Lutz Volkmann,
Stefan Winzen:
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments.
Discrete Mathematics 283(1-3): 217-229 (2004) |
| 1 | EE | Lutz Volkmann,
Stefan Winzen:
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.
Discrete Mathematics 285(1-3): 267-278 (2004) |
