Meike Tewes

According to our database, Meike Tewes authored at least 13 papers between 1998 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

Longest Paths and Longest Cycles in Graphs with Large Degree Sums.

Ingo Schiermeyer, Meike Tewes

Graphs Comb., 2002

Conditions for <i>β</i>-perfectness.

Judith Keijsper, Meike Tewes

Discuss. Math. Graph Theory, 2002

Almost all almost regular <i>c</i>-partite tournaments with <i>c</i>geq5 are vertex pancyclic.

Meike Tewes, Lutz Volkmann, Anders Yeo

Discret. Math., 2002

Three-colourability and forbidden subgraphs. II: polynomial algorithms.

Bert Randerath, Ingo Schiermeyer, Meike Tewes

Discret. Math., 2002

2001

Vertex pancyclic in-tournaments.

Meike Tewes, Lutz Volkmann

J. Graph Theory, 2001

The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.

Meike Tewes, Lutz Volkmann

Discret. Math., 2001

Pancyclic in-tournaments.

Meike Tewes

Discret. Math., 2001

2000

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.

Gregory Z. Gutin, Meike Tewes, Anders Yeo

Discret. Math., 2000

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.

Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo

Discret. Math., 2000

1999

Pancyclic orderings of in-tournaments.

Meike Tewes

Electron. Notes Discret. Math., 1999

Vertex Pancyclic Graphs.

Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes

Electron. Notes Discret. Math., 1999

Vertex deletion and cycles in multipartite tournaments.

Meike Tewes, Lutz Volkmann

Discret. Math., 1999

1998

On the cycle structure of in-tournaments.

Meike Tewes, Lutz Volkmann

Australas. J Comb., 1998