Stefan Winzen

According to our database1, Stefan Winzen authored at least 14 papers between 2003 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Every cycle-connected multipartite tournament has a universal arc.
Discret. Math., 2009

Complementary cycles in regular multipartite tournaments, where one cycle has length five.
Discret. Math., 2009

2008
Strong subtournaments containing a given vertex in regular multipartite tournaments.
Discret. Math., 2008

Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5.
Discret. Math., 2008

How close to regular must a multipartite tournament be to secure a given path covering number?
Ars Comb., 2008

Restricted arc-connectivity of generalized tournaments.
Australas. J Comb., 2008

2007
Strongly 4-path-connectivity in almost regular multipartite tournaments.
Discret. Math., 2007

2006
Paths with a given number of vertices from each partite set in regular multipartite tournaments.
Discret. Math., 2006

On the connectivity of close to regular multipartite tournaments.
Discret. Appl. Math., 2006

2005
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c.
Australas. J Comb., 2005

2004
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.
Discret. Math., 2004

Cycles through a given arc and certain partite sets in almost regular multipartite tournaments.
Discret. Math., 2004

Strong subtournaments of close to regular multipartite tournaments.
Australas. J Comb., 2004

2003
Cycles through a given arc in almost regular multipartite tournaments.
Australas. J Comb., 2003


  Loading...