Meike Tewes - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2002

β-perfectnessJudith Keijsper, Meike Tewes. dmgt, 22(1):123-148, 2002. [doi]

Three-colourability and forbidden subgraphs. II: polynomial algorithmsBert Randerath, Ingo Schiermeyer, Meike Tewes. DM, 251(1-3):137-153, 2002. [doi]

Vertex pancyclic graphsBert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann. DAM, 120(1-3):219-237, 2002.

Longest Paths and Longest Cycles in Graphs with Large Degree SumsIngo Schiermeyer, Meike Tewes. gc, 18(3):633-643, 2002. [doi]

Pancyclic orderings of in-tournamentsMeike Tewes. DAM, 120(1-3):239-249, 2002.

Almost all almost regular ::::c::::-partite tournaments with ::::c::::geq5 are vertex pancyclicMeike Tewes, Lutz Volkmann, Anders Yeo. DM, 242(1-3):201-228, 2002. [doi]

2001

Pancyclic in-tournamentsMeike Tewes. DM, 233(1-3):193-204, 2001. [doi]

The ratio of the longest cycle and longest path in semicomplete multipartite digraphsMeike Tewes, Lutz Volkmann. DM, 231(1-3):453-457, 2001. [doi]

Vertex pancyclic in-tournamentsMeike Tewes, Lutz Volkmann. jgt, 36(2):84-104, 2001. [doi]

2000

Sufficient conditions for semicomplete multipartite digraphs to be HamiltonianYubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo. DM, 212(1-2):91-100, 2000. [doi]

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphsGregory Gutin, Meike Tewes, Anders Yeo. DM, 222(1-3):269-274, 2000. [doi]

1999

Vertex Pancyclic GraphsBert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes. endm, 3:166-170, 1999. [doi]

Pancyclic orderings of in-tournamentsMeike Tewes. endm, 3:185-188, 1999. [doi]

Vertex deletion and cycles in multipartite tournamentsMeike Tewes, Lutz Volkmann. DM, 197-198:769-779, 1999. [doi]

1998

On the cycle structure of in-tournamentsMeike Tewes, Lutz Volkmann. ajc, 18:293-302, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL