 |
Frank Görings
|
 |
- On 2-regular subgraphs in polyhedral graphs, Discrete Mathematics, 251 (2002), 97-102.
- Menger's Theorem, (with T. Böhme , J. Harant), Journal of Graph Theory, 37 (2001), 35-36.
- Short Proof of Menger's Theorem, Discrete Mathematics , 219 (2000), 295-29.
- A proof of Menger's Theorem by contraction, Discussiones Mathematicae, Graph Theory, 22 (2002), 111-112.
- Wegesysteme, Dissertationsschrift, TU Ilmenau, Dezember 2002.
- On short cycles through prescribed vertices of a graph, (with J. Harant, E. Hexel, Zs.Tuza), Discrete Mathematics 286 (2004), 67-74
- On domination in graphs, (with J. Harant ), Discussiones Mathematicae, Graph Theory 25 (2005) 7-12
- Mader Tools , DMTCS , Proceedings of EuroComb 2005.
- On cycles through specified vertices (with T. Gerlach, J. Harant, M.Tkáč ), Discrete Mathematics 306(2006) 831-835.
- F. Göring, C. Helmberg, and M. Wappler.
Embedded in the Shadow of the Separator
Preprint 2005-12, Technische Universität Chemnitz, Fakultät für Mathematik, September 2005.
- Local topological toughness, (with Gyula Y. Katona), accepted in Graphs and Combinatorics.
- Learning of Winning Strategies for Terminal Games with Linear-Size Memory, (with T. Böhme, Zs.Tuza, Herwig Unger), submitted to International Journal of Game Theory).
- On two-regular subgraphs forcing a cycle through specified vertices (with J. Harant ), in progress.
