Göring, Frank
In Aktion

Frank Görings
Veröffentlichungen

 Algorithmische und Diskrete Mathematik
  1. On 2-regular subgraphs in polyhedral graphs, Discrete Mathematics, 251 (2002), 97-102.
     
  2. Menger's Theorem, (with T. Böhme , J. Harant), Journal of Graph Theory, 37 (2001), 35-36.
     
  3. Short Proof of Menger's Theorem, Discrete Mathematics , 219 (2000), 295-29.
     
  4. A proof of Menger's Theorem by contraction, Discussiones Mathematicae, Graph Theory, 22 (2002), 111-112.
     
  5. Wegesysteme, Dissertationsschrift, TU Ilmenau, Dezember 2002.
     
  6. On short cycles through prescribed vertices of a graph, (with J. Harant, E. Hexel, Zs.Tuza), Discrete Mathematics 286 (2004), 67-74
     
  7. On domination in graphs, (with J. Harant ), Discussiones Mathematicae, Graph Theory 25 (2005) 7-12
     
  8. Mader Tools , DMTCS , Proceedings of EuroComb 2005.
     
  9. On cycles through specified vertices (with T. Gerlach, J. Harant, M.Tkáč ), Discrete Mathematics 306(2006) 831-835.
     
  10. 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.
     
  11. Local topological toughness, (with Gyula Y. Katona), accepted in Graphs and Combinatorics.
     
  12. 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).
     
  13. On two-regular subgraphs forcing a cycle through specified vertices (with J. Harant ), in progress.
     

TUCaktuell