| 2002 |
|---|
| 12 | | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes,
Lutz Volkmann:
Vertex pancyclic graphs.
Discrete Applied Mathematics 120(1-3): 219-237 (2002) |
| 11 | | Meike Tewes:
Pancyclic orderings of in-tournaments.
Discrete Applied Mathematics 120(1-3): 239-249 (2002) |
| 10 | EE | Meike Tewes,
Lutz Volkmann,
Anders Yeo:
Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic.
Discrete Mathematics 242(1-3): 201-228 (2002) |
| 9 | EE | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes:
Three-colourability and forbidden subgraphs. II: polynomial algorithms.
Discrete Mathematics 251(1-3): 137-153 (2002) |
| 8 | EE | Ingo Schiermeyer,
Meike Tewes:
Longest Paths and Longest Cycles in Graphs with Large Degree Sums.
Graphs and Combinatorics 18(3): 633-643 (2002) |
| 2001 |
|---|
| 7 | EE | Meike Tewes,
Lutz Volkmann:
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.
Discrete Mathematics 231(1-3): 453-457 (2001) |
| 6 | EE | Meike Tewes:
Pancyclic in-tournaments.
Discrete Mathematics 233(1-3): 193-204 (2001) |
| 2000 |
|---|
| 5 | EE | Yubao Guo,
Meike Tewes,
Lutz Volkmann,
Anders Yeo:
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
Discrete Mathematics 212(1-2): 91-100 (2000) |
| 4 | EE | Gregory Gutin,
Meike Tewes,
Anders Yeo:
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
Discrete Mathematics 222(1-3): 269-274 (2000) |
| 1999 |
|---|
| 3 | EE | Meike Tewes,
Lutz Volkmann:
Vertex deletion and cycles in multipartite tournaments.
Discrete Mathematics 197-198: 769-779 (1999) |
| 2 | EE | Bert Randerath,
Lutz Volkmann,
Ingo Schiermeyer,
Meike Tewes:
Vertex Pancyclic Graphs.
Electronic Notes in Discrete Mathematics 3: 166-170 (1999) |
| 1 | EE | Meike Tewes:
Pancyclic orderings of in-tournaments.
Electronic Notes in Discrete Mathematics 3: 185-188 (1999) |
