On the cycle structure of in-tournaments. - Meike Tewes; Lutz Volkmann (Australas. J Comb., 1998)

Vertex deletion and cycles in multipartite tournaments. - Meike Tewes; Lutz Volkmann (Discret. Math., 1999)

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. - Yubao Guo; Meike Tewes; Lutz Volkmann; Anders Yeo (Discret. Math., 2000)

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. - Gregory Z. Gutin; Meike Tewes; Anders Yeo (Discret. Math., 2000)

Pancyclic in-tournaments. - Meike Tewes (Discret. Math., 2001)

The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. - Meike Tewes; Lutz Volkmann (Discret. Math., 2001)

Vertex pancyclic in-tournaments. - Meike Tewes; Lutz Volkmann (J. Graph Theory, 2001)

Vertex pancyclic graphs. - Bert Randerath; Ingo Schiermeyer; Meike Tewes; Lutz Volkmann (Discret. Appl. Math., 2002)

Pancyclic orderings of in-tournaments. - Meike Tewes (Discret. Appl. Math., 2002)

Three-colourability and forbidden subgraphs. II: polynomial algorithms. - Bert Randerath; Ingo Schiermeyer; Meike Tewes (Discret. Math., 2002)

Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. - Meike Tewes; Lutz Volkmann; Anders Yeo (Discret. Math., 2002)

Conditions for β-perfectness. - Judith Keijsper; Meike Tewes (Discuss. Math. Graph Theory, 2002)

Longest Paths and Longest Cycles in Graphs with Large Degree Sums. - Ingo Schiermeyer; Meike Tewes (Graphs Comb., 2002)