On the maximum number of cycles in a Hamiltonian graph. - Dieter Rautenbach; Irene Stella (Discret. Math., 2005)

Strongly 4-path-connectivity in almost regular multipartite tournaments. - Irene Stella; Lutz Volkmann; Stefan Winzen (Discret. Math., 2007)

How close to regular must a multipartite tournament be to secure a given path covering number? - Irene Stella; Lutz Volkmann; Stefan Winzen (Ars Comb., 2008)