Short proof of Menger's Theorem. - Frank Göring (Discret. Math., 2000)

Menger's Theorem. - Thomas Böhme 001; Frank Göring; Jochen Harant (J. Graph Theory, 2001)

On 2-regular subgraphs in polyhedral graphs. - Frank Göring (Discret. Math., 2002)

A proof of Menger's Theorem by contraction. - Frank Göring (Discuss. Math. Graph Theory, 2002)

On short cycles through prescribed vertices of a graph. - Frank Göring; Jochen Harant; Erhard Hexel; Zsolt Tuza (Discret. Math., 2004)

On Domination in Graphs. - Frank Göring; Jochen Harant (Discuss. Math. Graph Theory, 2005)

On cycles through specified vertices. - Tobias Gerlach; Frank Göring; Jochen Harant; Michal Tkác (Discret. Math., 2006)

Local Topological Toughness and Local Factors. - Frank Göring; Gyula Y. Katona (Graphs Comb., 2007)

Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach. - Frank Göring; Jochen Harant (Bonn Workshop of Combinatorial Optimization, 2008)

Embedded in the Shadow of the Separator. - Frank Göring; Christoph Helmberg; Markus Wappler (SIAM J. Optim., 2008)

On F-independence in graphs. - Frank Göring; Jochen Harant; Dieter Rautenbach; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2009)

Learning of winning strategies for terminal games with linear-size memory. - Thomas Böhme 001; Frank Göring; Zsolt Tuza; Herwig Unger (Int. J. Game Theory, 2009)

Random Procedures for Dominating Sets in Graphs. - Sarah Artmann; Frank Göring; Jochen Harant; Dieter Rautenbach; Ingo Schiermeyer (Electron. J. Comb., 2010)

Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. - Frank Göring; Jochen Harant (Discret. Math., 2010)

GreedyMAX-type Algorithms for the Maximum Independent Set Problem. - Piotr Borowiecki; Frank Göring (SOFSEM, 2011)

The rotational dimension of a graph. - Frank Göring; Christoph Helmberg; Markus Wappler (J. Graph Theory, 2011)

The potential of greed for independence. - Piotr Borowiecki; Frank Göring; Jochen Harant; Dieter Rautenbach (J. Graph Theory, 2012)

Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. - Frank Göring; Christoph Helmberg; Susanna Reiss (Math. Program., 2012)

Prescribed edges and forbidden edges for a cycle in a planar graph. - Frank Göring; Jochen Harant (Discret. Appl. Math., 2013)

On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. - Frank Göring; Christoph Helmberg; Susanna Reiss (SIAM J. Optim., 2013)

Unique-maximum coloring of plane graphs. - Igor Fabrici; Frank Göring (Discuss. Math. Graph Theory, 2016)

Uniformly connected graphs. - Frank Göring; Tobias Hofmann; Manuel Streicher (J. Graph Theory, 2022)

The edge-transitive polytopes that are not vertex-transitive. - Frank Göring; Martin Winter (Ars Math. Contemp., 2022)

Properties of uniformly 3-connected graphs. - Frank Göring; Tobias Hofmann (Discret. Math. Theor. Comput. Sci., 2023)