Frank Göring

Tobias Hofmann

Discret. Math. Theor. Comput. Sci., 2023

2022

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

[BibT_eX]

[DOI]

Martin Winter

Ars Math. Contemp., November, 2022

Uniformly connected graphs.

[BibT_eX]

[DOI]

Tobias Hofmann

Manuel Streicher

J. Graph Theory, 2022

2016

Unique-maximum coloring of plane graphs.

[BibT_eX]

[DOI]

Igor Fabrici

Discuss. Math. Graph Theory, 2016

2013

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

[BibT_eX]

[DOI]

Susanna Reiss

SIAM J. Optim., 2013

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

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

[BibT_eX]

[DOI]

Susanna Reiss

Math. Program., 2012

The potential of greed for independence.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

2011

The rotational dimension of a graph.

[BibT_eX]

[DOI]

Markus Wappler

J. Graph Theory, 2011

GreedyMAX-type Algorithms for the Maximum Independent Set Problem.

[BibT_eX]

[DOI]

Piotr Borowiecki

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

2010

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

[BibT_eX]

[DOI]

Discret. Math., 2010

Random Procedures for Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

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

[BibT_eX]

[DOI]

Int. J. Game Theory, 2009

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

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

2008

Embedded in the Shadow of the Separator.

[BibT_eX]

[DOI]

Markus Wappler

SIAM J. Optim., 2008

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

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Local Topological Toughness and Local Factors.

[BibT_eX]

[DOI]

Gyula Y. Katona

Graphs Comb., 2007

2006

On cycles through specified vertices.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

On Domination in Graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

2004

On short cycles through prescribed vertices of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2004

2002

A proof of Menger's Theorem by contraction.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2002

On 2-regular subgraphs in polyhedral graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Menger's Theorem.

[BibT_eX]

[DOI]

Thomas Böhme

J. Graph Theory, 2001

2000

Short proof of Menger's Theorem.

[BibT_eX]

[DOI]