Frank Göring

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Properties of uniformly $3$-connected graphs	2024	Frank Göring Tobias Hofmann
+ PDF Chat	The edge-transitive polytopes that are not vertex-transitive	2022	Frank Göring Martin Winter
+ PDF Chat	Uniformly connected graphs	2022	Frank Göring Tobias Hofmann Manuel Streicher
+	Properties of uniformly $3$-connected graphs	2022	Frank Göring Tobias Hofmann
+	Uniformly connected graphs	2021	Frank Göring Tobias Hofmann Manuel Streicher
+	Uniformly connected graphs	2021	Frank Göring Tobias Hofmann Manuel Streicher
+	The Edge-transitive Polytopes that are not Vertex-transitive	2020	Frank Göring Martin Winter
+	On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations	2013	Frank Göring Christoph Helmberg Susanna Reiß
+	The potential of greed for independence	2011	Piotr Borowiecki Frank Göring Jochen Harant Dieter Rautenbach
+	Prescribed edges and forbidden edges for a cycle in a planar graph	2011	Frank Göring Jochen Harant
+	The rotational dimension of a graph	2010	Frank Göring Christoph Helmberg Markus Wappler
+ PDF Chat	Random Procedures for Dominating Sets in Graphs	2010	Sarah Artmann Frank Göring Jochen Harant Dieter Rautenbach Ingo Schiermeyer
+	Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian	2010	Frank Göring Christoph Helmberg Susanna Reiß
+ PDF Chat	On F-independence in graphs	2009	Frank Göring Jochen Harant Dieter Rautenbach Ingo Schiermeyer
+	Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach	2008	Frank Göring Jochen Harant Dieter Rautenbach Ingo Schiermeyer
+ PDF Chat	Embedded in the Shadow of the Separator	2008	Frank Göring Christoph Helmberg Markus Wappler
+	Locally dense independent sets in regular graphs of large girth	2007	Frank Göring Jochen Harant Dieter Rautenbach Ingo Schiermeyer
+	Local Topological Toughness and Local Factors	2007	Frank Göring Gyula Y. Katona
+ PDF Chat	The rotational Dimension of a graph	2006	Frank Göring Christoph Helmberg Markus Wappler
+	On cycles through specified vertices	2006	Tobias Gerlach Frank Göring Jochen Harant Michal Tkáč
+ PDF Chat	On Domination in Graphs	2005	Frank Göring Jochen Harant
+	On short cycles through prescribed vertices of a graph	2004	Frank Göring Jochen Harant Erhard Hexel Zs. Tuza
+	On 2-regular subgraphs in polyhedral graphs	2002	Frank Göring
+ PDF Chat	A proof of Menger's Theorem by contraction	2002	Frank Göring
+	Menger's Theorem	2001	Thomas Böhme Frank Göring Jochen Harant
+	Menger's Theorem	2001	Thomas Böhme Frank Göring Jochen Harant
+	Short proof of Menger's Theorem	2000	Frank Göring

Common Coauthors

Coauthor	Papers Together
Jochen Harant	11
Christoph Helmberg	5
Dieter Rautenbach	5
Ingo Schiermeyer	4
Tobias Hofmann	3
Manuel Streicher	3
Markus Wappler	3
Martin Winter	2
Thomas Böhme	2
Susanna Reiß	2
Tobias Hofmann	2
Michal Tkáč	1
Erhard Hexel	1
Zs. Tuza	1
Sarah Artmann	1
Piotr Borowiecki	1
Gyula Y. Katona	1
Tobias Gerlach	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Zur allgemeinen Kurventheorie	1927	Karl Menger	7
+ PDF Chat	The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem	2006	Jun Sun Stephen Boyd Lin Xiao Persi Diaconis	4
+	THE LAPLACIAN SPECTRUM OF GRAPHS y	1991	Bojan Mohar	4
+	Absolute algebraic connectivity of trees	1990	Miroslav Fiedler	4
+	None	2001	Fengming Dong K.M. Koh Kee L. Teo Charles H. C. Little M. D. Hendy	4
+	The Colin de Verdière graph parameter	1999	Hein van der Holst László Lovász Alexander Schrijver	4
+ PDF Chat	Laplacian of graphs and algebraic connectivity	1989	Miroslav Fiedler	4
+	Spectra of graphs	1980	Cvetkovi cacute Mikhina Vs Michael Doob H. Sachs	4
+	Spectra of graphs : theory and application	1995	Dragoš Cvetković Michael Doob H. Sachs	4
+ PDF Chat	Embedded in the Shadow of the Separator	2008	Frank Göring Christoph Helmberg Markus Wappler	3
+	4‐chrome Graphen und vollständige 4‐Graphen	1960	G. A. Dirac	3
+	When m vertices in a k-connected graph cannot be walked round along a simple cycle	1982	Alexander Kelmans M. V. Lomonosov	3
+	On paths and cycles through specified vertices	2004	Jochen Harant	3
+	Menger's Theorem	2001	Thomas Böhme Frank Göring Jochen Harant	3
+	Tight bounds for the vertices of degree k in minimally k‐connected graphs	2017	Jens M. Schmidt	2
+	A note on the independence number of triangle-free graphs	1983	James B. Shearer	2
+	Several sharp upper bounds for the largest laplacian eigenvalue of a graph	2007	Tian-fei Wang	2
+ PDF Chat	Eigenvalues in Combinatorial Optimization	1993	Bojan Mohar Svatopluk Poljak	2
+ PDF Chat	Minimizing Effective Resistance of a Graph	2008	Arpita Ghosh Stephen Boyd Amin Saberi	2
+	The rotational dimension of a graph	2010	Frank Göring Christoph Helmberg Markus Wappler	2
+ PDF Chat	Handbook of Semidefinite Programming	2000	Henry Wolkowicz Romesh Saigal Lieven Vandenberghe	2
+ PDF Chat	Girth and Independence Ratio	1982	Glenn Hopkins William Staton	2
+ PDF Chat	Algebraic connectivity of graphs	1973	Miroslav Fiedler	2
+ PDF Chat	Hyper-Wiener index and Laplacian spectrum	2003	Iván Gutman	2
+	A note on the independence number of triangle-free graphs, II	1991	James B. Shearer	2
+	A spectral approach to bandwidth and separator problems in graphs	1995	Christoph Helmberg Franz Rendl Bojan Mohar Svatopluk Poljak	2
+	Expanding and forwarding	1995	Patrick Solé	2
+	The vertex-connectivity of a distance-regular graph	2008	Andries E. Brouwer Jack H. Koolen	2
+ PDF Chat	Eigenvalues and the max-cut problem	1990	Bojan Mohar Svatopluk Poljak	2
+ PDF Chat	Consistency of spectral clustering	2008	Ulrike von Luxburg Mikhail A. Belkin Olivier Bousquet	2
+	Uniformly Connected Graphs — A Survey	2020	Gary Chartrand Ping Zhang	2
+	Cycles through specified vertices	1993	Béla Bollobás Graham Brightwell	2
+ PDF Chat	Hyper-Wiener index and Laplacian spectrum	2003	Iván Gutman	2
+	Improved lower bounds on <i>k</i>‐independence	1991	Yair Caro Źsolt Tuza	2
+	On the Shannon capacity of a graph	1979	László Lovász	2
+	Large independent sets in regular graphs of large girth	2007	Joseph Lauer Nicholas Wormald	2
+ PDF Chat	Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph	2005	Bo Zhou Han Hyuk Cho	2
+	Connectivity in Graphs	1966	W. T. Tutte	2
+ PDF Chat	The independence ratio of regular graphs	1981	Béla Bollobás	2
+ PDF Chat	On connectivity in matroids and graphs	1981	James Oxley	2
+	Bounds on the (Laplacian) spectral radius of graphs	2007	Lingsheng Shi	2
+ PDF Chat	Differential Equations for Random Processes and Random Graphs	1995	Nicholas Wormald	2
+ PDF Chat	Chemical applications of the Laplacian spectrum. VI On the largest Laplacian eigenvalue of alkanes	2002	Iván Gutman Dušica Vidović Dragan Stevanović	2
+	Symmetry in semidefinite programs	2008	Frank Vallentin	1
+	Coin graphs, Polyhedra, and conformal mapping	1994	H. Sachs	1
+	A Probabilistic lower bound on the independence number of graphs	1994	Stanley M. Selkow	1
+	Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones	1999	J.F. Sturm	1
+ PDF Chat	On Domination in Graphs	2005	Frank Göring Jochen Harant	1
+	Multiplicities of Eigenvalues and Tree-Width of Graphs	1998	Yves Colin de Verdìère	1
+ PDF Chat	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming	1995	Michel X. Goemans David P. Williamson	1