Publikationen von Winzen

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (21 Publikationen)
1   2     »
 
Publications 2010
On the path covering number of given subdigraphs of regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
J. Combin. Math. Combin. Comput. 72 (2010), 211--230.
 
Publications 2009
Complementary cycles in regular multipartite tournaments, where one cycle has length five  
Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
Discrete Math. 309 (2009), 3131--3149.
Every cycle-connected multipartite tournament has a universal arc  
Lutz Volkmann, Stefan Winzen
Discrete Math. 309 (2009), no. 4, 1013--1017.
 
Publications 2008
Restricted arc-connectivity of generalized tournaments  
Dirk Meierling, Lutz Volkmann, Stefan Winzen
Australas. J. Combin. 40 (2008), 269--278.
How close to regular must a multipartite tournament be to secure a given path covering number?  
Irene Stella, Lutz Volkmann, Stefan Winzen
Ars Combin. 87 (2008), 359--375.
Almost regular c-partite tournaments contain a strong subtournament of order c when c>=5  
Lutz Volkmann, Stefan Winzen
Discrete Math. 308 (2008), no. 9, 1710--1721.
Strong subtournaments containing a given vertex in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 308 (2008), no. 23, 5516--5521.
Weakly complementary cycles in 3-connected multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Kyungpook Math. J. 48 (2008), no. 2, 287--302.
 
Publications 2007
Strongly 4-path-connectivity in almost regular multipartite tournaments  
Irene Stella, Lutz Volkmann, Stefan Winzen
Discrete Math. 307 (2007), no. 24, 3213--3219.
Cycles through a given set of vertices in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
J. Korean Math. Soc. 44 (2007), no. 3, 683--695.
 
Publications 2006
Cycles with a given number of vertices from each partite set in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Czechoslovak Math. J. 56(131) (2006), no. 3, 827--843.
On the connectivity of close to regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Appl. Math. 154 (2006), no. 9, 1437--1452.
Paths with a given number of vertices from each partite set in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 306 (2006), no. 21, 2724--2732.
 
Publications 2005
Almost regular c-partite tournaments with c>=8 contain an n-cycle through a given arc for 4<=n<=c  
Lutz Volkmann, Stefan Winzen
Australas. J. Combin. 31 (2005), 61--84.
 
Publications 2004
Erster Aachener Tag der Graphentheorie  
Miranca Fischermann, Yubao Guo, Angelika Hellwig, Arne Hoffmann, Dirk Meierling, Bert Randerath, Dieter Rautenbach, Meike Tewes, Stefan Winzen
, Rheinisch-Westfälische Technische Hochschule Aachen (2004).
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc  
Lutz Volkmann, Stefan Winzen
Discrete Math. 285 (2004), no. 1-3, 267--278.
Close to regular multipartite tournaments containing a Hamiltonian path  
Lutz Volkmann, Stefan Winzen
J. Combin. Math. Combin. Comput. 49 (2004), 195--210.
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 283 (2004), no. 1-3, 217--229.
Almost regular multipartite tournaments  
Stefan Winzen
In Erster Aachener Tag der Graphentheorie, Rheinisch-Westfälisch Technische Hochschule Aachen (2004), 41--46.
Strong subtournaments of close to regular multipartite tournaments  
Stefan Winzen
Australas. J. Combin. 29 (2004), 49--57.

Gesamte Liste anzeigen (21 Publikationen)
1   2     »