Stefan Winzen

Available identifiers

zbMath Open winzen.stefanMaRDI QIDQ998430

List of research outcomes

Publication	Date of Publication	Type
How close to regular must a multipartite tournament be to secure a given path covering number?	2011-02-02	Paper
On the path covering number of given subdigraphs of regular multipartite tournaments	2010-06-17	Paper
Complementary cycles in regular multipartite tournaments, where one cycle has length five	2009-06-23	Paper
Every cycle-connected multipartite tournament has a universal arc	2009-04-09	Paper
Cycles with a given number of vertices from each partite set in regular multipartite tournaments	2009-02-09	Paper
Strong subtournaments containing a given vertex in regular multipartite tournaments	2009-01-28	Paper
Weakly Complementary Cycles in 3-Connected Multipartite Tournaments	2008-09-25	Paper
Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)	2008-03-13	Paper
Restricted arc-connectivity of generalized tournaments	2008-03-11	Paper
Strongly 4-path-connectivity in almost regular multipartite tournaments	2007-12-06	Paper
CYCLES THROUGH A GIVEN SET OF VERTICES IN REGULAR MULTIPARTITE TOURNAMENTS	2007-10-22	Paper
Paths with a given number of vertices from each partite set in regular multipartite tournaments	2006-10-30	Paper
On the connectivity of close to regular multipartite tournaments	2006-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q5702646	2005-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q4659586	2005-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4826284	2004-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4818783	2004-10-01	Paper
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc	2004-08-19	Paper
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4405652	2003-11-10	Paper

Research outcomes over time

This page was built for person: Stefan Winzen