Frank Göring

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Properties of uniformly $3$-connected graphs Discrete Mathematics and Theoretical Computer Science. DMTCS	2024-09-06	Paper
Uniformly connected graphs Journal of Graph Theory	2023-10-05	Paper
The edge-transitive polytopes that are not vertex-transitive Ars Mathematica Contemporanea	2023-01-23	Paper
Properties of uniformly $3$-connected graphs	2022-11-30	Paper
The Edge-transitive Polytopes that are not Vertex-transitive (available as arXiv preprint)	2020-05-28	Paper
Locally dense independent sets in regular graphs of~large~girth -- an example of a new approach Research Trends in Combinatorial Optimization	2017-04-07	Paper
Unique-maximum coloring of plane graphs Discussiones Mathematicae Graph Theory	2016-01-26	Paper
Prescribed edges and forbidden edges for a cycle in a planar graph Discrete Applied Mathematics	2014-04-16	Paper
On minimizing the spectral width of graph Laplacians and associated graph realizations SIAM Journal on Optimization	2013-09-25	Paper
The potential of greed for independence Journal of Graph Theory	2012-11-23	Paper
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian Mathematical Programming. Series A. Series B	2012-02-22	Paper
Learning of winning strategies for terminal games with linear-size memory International Journal of Game Theory	2011-05-05	Paper
The rotational dimension of a graph Journal of Graph Theory	2011-04-19	Paper
GreedyMAX-type algorithms for the maximum independent set problem SOFSEM 2011: Theory and Practice of Computer Science	2011-02-15	Paper
Random procedures for dominating sets in graphs The Electronic Journal of Combinatorics	2010-08-12	Paper
Random procedures for dominating sets in graphs The Electronic Journal of Combinatorics	2010-08-12	Paper
Mader tools	2010-07-30	Paper
On ${\mathcal F}$-independence in graphs Discussiones Mathematicae Graph Theory	2010-05-14	Paper
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs Discrete Mathematics	2010-05-05	Paper
Embedded in the Shadow of the Separator SIAM Journal on Optimization	2009-03-06	Paper
Local topological toughness and local factors Graphs and Combinatorics	2007-10-11	Paper
The rotational Dimension of a graph Electronic Notes in Discrete Mathematics	2007-05-29	Paper
On cycles through specified vertices Discrete Mathematics	2006-06-30	Paper
On Domination in Graphs Discussiones Mathematicae Graph Theory	2005-09-12	Paper
On short cycles through prescribed vertices of a graph Discrete Mathematics	2004-10-01	Paper
A proof of Menger's Theorem by contraction Discussiones Mathematicae Graph Theory	2003-08-28	Paper
On 2-regular subgraphs in polyhedral graphs Discrete Mathematics	2002-08-29	Paper
Menger's theorem Journal of Graph Theory	2002-07-22	Paper
Short proof of Menger's theorem Discrete Mathematics	2000-06-21	Paper

Research outcomes over time

This page was built for person: Frank Göring

Publication	Date of Publication	Type
Properties of uniformly \(3\)-connected graphs Discrete Mathematics and Theoretical Computer Science. DMTCS	2024-09-06	Paper
Uniformly connected graphs Journal of Graph Theory	2023-10-05	Paper
The edge-transitive polytopes that are not vertex-transitive Ars Mathematica Contemporanea	2023-01-23	Paper
Properties of uniformly $3$-connected graphs	2022-11-30	Paper
The Edge-transitive Polytopes that are not Vertex-transitive (available as arXiv preprint)	2020-05-28	Paper
Locally dense independent sets in regular graphs of~large~girth -- an example of a new approach Research Trends in Combinatorial Optimization	2017-04-07	Paper
Unique-maximum coloring of plane graphs Discussiones Mathematicae Graph Theory	2016-01-26	Paper
Prescribed edges and forbidden edges for a cycle in a planar graph Discrete Applied Mathematics	2014-04-16	Paper
On minimizing the spectral width of graph Laplacians and associated graph realizations SIAM Journal on Optimization	2013-09-25	Paper
The potential of greed for independence Journal of Graph Theory	2012-11-23	Paper
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian Mathematical Programming. Series A. Series B	2012-02-22	Paper
Learning of winning strategies for terminal games with linear-size memory International Journal of Game Theory	2011-05-05	Paper
The rotational dimension of a graph Journal of Graph Theory	2011-04-19	Paper
GreedyMAX-type algorithms for the maximum independent set problem SOFSEM 2011: Theory and Practice of Computer Science	2011-02-15	Paper
Random procedures for dominating sets in graphs The Electronic Journal of Combinatorics	2010-08-12	Paper
Random procedures for dominating sets in graphs The Electronic Journal of Combinatorics	2010-08-12	Paper
Mader tools	2010-07-30	Paper
On \({\mathcal F}\)-independence in graphs Discussiones Mathematicae Graph Theory	2010-05-14	Paper
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs Discrete Mathematics	2010-05-05	Paper
Embedded in the Shadow of the Separator SIAM Journal on Optimization	2009-03-06	Paper
Local topological toughness and local factors Graphs and Combinatorics	2007-10-11	Paper
The rotational Dimension of a graph Electronic Notes in Discrete Mathematics	2007-05-29	Paper
On cycles through specified vertices Discrete Mathematics	2006-06-30	Paper
On Domination in Graphs Discussiones Mathematicae Graph Theory	2005-09-12	Paper
On short cycles through prescribed vertices of a graph Discrete Mathematics	2004-10-01	Paper
A proof of Menger's Theorem by contraction Discussiones Mathematicae Graph Theory	2003-08-28	Paper
On 2-regular subgraphs in polyhedral graphs Discrete Mathematics	2002-08-29	Paper
Menger's theorem Journal of Graph Theory	2002-07-22	Paper
Short proof of Menger's theorem Discrete Mathematics	2000-06-21	Paper