Frank Göring

According to our database, Frank Göring authored at least 23 papers between 2000 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

The edge-transitive polytopes that are not vertex-transitive.

Frank Göring, Martin Winter

Ars Math. Contemp., November, 2022

Uniformly connected graphs.

Frank Göring, Tobias Hofmann, Manuel Streicher

J. Graph Theory, 2022

2016

Unique-maximum coloring of plane graphs.

Igor Fabrici, Frank Göring

Discuss. Math. Graph Theory, 2016

2013

On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations.

Frank Göring, Christoph Helmberg, Susanna Reiss

SIAM J. Optim., 2013

Prescribed edges and forbidden edges for a cycle in a planar graph.

Frank Göring, Jochen Harant

Discret. Appl. Math., 2013

2012

Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.

Frank Göring, Christoph Helmberg, Susanna Reiss

Math. Program., 2012

The potential of greed for independence.

Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach

J. Graph Theory, 2012

2011

GreedyMAX-type Algorithms for the Maximum Independent Set Problem.

Piotr Borowiecki, Frank Göring

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

2010

Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs.

Frank Göring, Jochen Harant

Discret. Math., 2010

Random Procedures for Dominating Sets in Graphs.

Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer

Electron. J. Comb., 2010

2009

Learning of winning strategies for terminal games with linear-size memory.

Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger

Int. J. Game Theory, 2009

On <i> F</i>-independence in graphs.

Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer

Discuss. Math. Graph Theory, 2009

2008

Embedded in the Shadow of the Separator.

Frank Göring, Christoph Helmberg, Markus Wappler

SIAM J. Optim., 2008

Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach.

Frank Göring, Jochen Harant

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Local Topological Toughness and Local Factors.

Frank Göring, Gyula Y. Katona

Graphs Comb., 2007

2006

The rotational Dimension of a graph.

Frank Göring, Christoph Helmberg, Markus Wappler

Electron. Notes Discret. Math., 2006

On cycles through specified vertices.

Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác

Discret. Math., 2006

2005

On Domination in Graphs.

Frank Göring, Jochen Harant

Discuss. Math. Graph Theory, 2005

2004

On short cycles through prescribed vertices of a graph.

Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza

Discret. Math., 2004

2002

A proof of Menger's Theorem by contraction.

Frank Göring

Discuss. Math. Graph Theory, 2002

On 2-regular subgraphs in polyhedral graphs.

Frank Göring

Discret. Math., 2002

2001

Menger's Theorem.

Thomas Böhme, Frank Göring, Jochen Harant

J. Graph Theory, 2001

2000

Short proof of Menger's Theorem.

Frank Göring

Discret. Math., 2000