default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Göring
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]Frank Göring, Martin Winter:
The edge-transitive polytopes that are not vertex-transitive. Ars Math. Contemp. 23(2) (2022)- [j21]Frank Göring
, Tobias Hofmann, Manuel Streicher:
Uniformly connected graphs. J. Graph Theory 101(2): 210-225 (2022)
2010 – 2019
- 2016
- [j20]Igor Fabrici, Frank Göring:
Unique-maximum coloring of plane graphs. Discuss. Math. Graph Theory 36(1): 95-102 (2016) - 2013
- [j19]Frank Göring, Jochen Harant:
Prescribed edges and forbidden edges for a cycle in a planar graph. Discret. Appl. Math. 161(12): 1734-1738 (2013) - [j18]Frank Göring, Christoph Helmberg, Susanna Reiss:
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. SIAM J. Optim. 23(2): 834-856 (2013) - 2012
- [j17]Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach:
The potential of greed for independence. J. Graph Theory 71(3): 245-259 (2012) - [j16]Frank Göring, Christoph Helmberg, Susanna Reiss:
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. Math. Program. 131(1-2): 95-111 (2012) - 2011
- [j15]Frank Göring, Christoph Helmberg, Markus Wappler:
The rotational dimension of a graph. J. Graph Theory 66(4): 283-302 (2011) - [c2]Piotr Borowiecki, Frank Göring:
GreedyMAX-type Algorithms for the Maximum Independent Set Problem. SOFSEM 2011: 146-156 - 2010
- [j14]Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17(1) (2010) - [j13]Frank Göring, Jochen Harant:
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. Discret. Math. 310(9): 1491-1494 (2010)
2000 – 2009
- 2009
- [j12]Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
On F-independence in graphs. Discuss. Math. Graph Theory 29(2): 377-383 (2009) - [j11]Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger:
Learning of winning strategies for terminal games with linear-size memory. Int. J. Game Theory 38(2): 155-168 (2009) - 2008
- [j10]Frank Göring, Christoph Helmberg, Markus Wappler:
Embedded in the Shadow of the Separator. SIAM J. Optim. 19(1): 472-501 (2008) - [c1]Frank Göring, Jochen Harant:
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach. Bonn Workshop of Combinatorial Optimization 2008: 163-183 - 2007
- [j9]Frank Göring, Gyula Y. Katona:
Local Topological Toughness and Local Factors. Graphs Comb. 23(4): 387-399 (2007) - 2006
- [j8]Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác:
On cycles through specified vertices. Discret. Math. 306(8-9): 831-835 (2006) - [j7]Frank Göring, Christoph Helmberg, Markus Wappler:
The rotational Dimension of a graph. Electron. Notes Discret. Math. 27: 37-38 (2006) - 2005
- [j6]Frank Göring, Jochen Harant:
On Domination in Graphs. Discuss. Math. Graph Theory 25(1-2): 7-12 (2005) - 2004
- [j5]Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza:
On short cycles through prescribed vertices of a graph. Discret. Math. 286(1-2): 67-74 (2004) - 2002
- [j4]Frank Göring:
On 2-regular subgraphs in polyhedral graphs. Discret. Math. 251(1-3): 97-102 (2002) - [j3]Frank Göring:
A proof of Menger's Theorem by contraction. Discuss. Math. Graph Theory 22(1): 111-112 (2002) - 2001
- [j2]Thomas Böhme, Frank Göring, Jochen Harant:
Menger's Theorem. J. Graph Theory 37(1): 35-36 (2001) - 2000
- [j1]Frank Göring:
Short proof of Menger's Theorem. Discret. Math. 219(1-3): 295-296 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
