Henning Bruhn

J. Graph Theory, 2022

Packing A-paths of length zero modulo four.

[BibT_eX]

[DOI]

Arthur Ulmer

Eur. J. Comb., 2022

2021

Erdös-Pósa Property for Labeled Minors: 2-Connected Minors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

K4-Subdivisions Have the Edge-Erdös-Pósa Property.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

The Edge-Erdős-Pósa Property.

[BibT_eX]

[DOI]

Comb., 2021

2019

Long Cycles have the Edge-Erdős-Pósa Property.

[BibT_eX]

[DOI]

Comb., 2019

2018

Frames, A-Paths, and the Erdös-Pósa Property.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Long cycles through prescribed vertices have the Erdős-Pósa property.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

2017

t-Perfection in P5-Free Graphs.

[BibT_eX]

[DOI]

Elke Fuchs

SIAM J. Discret. Math., 2017

Jacobsthal Numbers in Generalized Petersen Graphs.

[BibT_eX]

[DOI]

Laura Gellert

Jacob Günther

J. Graph Theory, 2017

K4-expansions have the edge-Erdős-Pósa property.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

The union-closed sets conjecture almost holds for almost all random bipartite graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Fast Algorithms for Delta-Separated Sparsity Projection.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

List Edge-Coloring and Total Coloring in Graphs of Low Treewidth.

[BibT_eX]

[DOI]

Richard Lang

J. Graph Theory, 2016

Chromatic index, treewidth and maximum degree.

[BibT_eX]

[DOI]

Laura Gellert

Richard Lang

Electron. Notes Discret. Math., 2016

Structural Parameterizations for Boxicity.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

The Journey of the Union-Closed Sets Conjecture.

[BibT_eX]

[DOI]

Graphs Comb., 2015

A stronger bound for the strong chromatic index.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Jacobsthal numbers in generalised Petersen graphs.

[BibT_eX]

[DOI]

Laura Gellert

Jacob Günther

Electron. Notes Discret. Math., 2015

The graph formulation of the union-closed sets conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

2014

Minimal bricks have many vertices of small degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Matroid and Tutte-connectivity in Infinite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Small degree vertices in minimal bricks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Colouring stability two unit disk graphs.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2013

2012

On claw-free t-perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 2012

Clique or hole in claw-free graphs.

[BibT_eX]

[DOI]

Akira Saito

J. Comb. Theory B, 2012

Finite connectivity in infinite matroids.

[BibT_eX]

[DOI]

Paul Wollan

Eur. J. Comb., 2012

2011

Twins of rayless graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Infinite matroids in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Eulerian edge sets in locally finite graphs.

[BibT_eX]

[DOI]

Eli Berger

Comb., 2011

2010

t-Perfection Is Always Strong for Claw-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Duality of Ends.

[BibT_eX]

[DOI]

Maya Jakobine Stein

Comb. Probab. Comput., 2010

2009

MacLane's theorem for arbitrary surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Characterising claw-free t-perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Every rayless graph has an unfriendly partition.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Philipp Sprüssel

Electron. Notes Discret. Math., 2009

Bicycles and left-right tours in locally finite graphs.

[BibT_eX]

[DOI]

Stefanie Kosuch

Melanie Win Myint

Eur. J. Comb., 2009

2008

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.

[BibT_eX]

[DOI]

Theory Comput., 2008

Hamilton Cycles in Planar Locally Finite Graphs.

[BibT_eX]

[DOI]

Xingxing Yu

SIAM J. Discret. Math., 2008

Periodical states and marching groups in a closed owari.

[BibT_eX]

[DOI]

Discret. Math., 2008

Degree Constrained Orientations in Countable Graphs.

[BibT_eX]

[DOI]

Attila Bernáth

Electron. J. Comb., 2008

2007

On end degrees and infinite cycles in locally finite graphs.

[BibT_eX]

[DOI]

Comb., 2007

Single source multiroute flows and cuts on uniform capacity networks.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

MacLane's planarity criterion for locally finite graphs.

[BibT_eX]

[DOI]

Maya Jakobine Stein

J. Comb. Theory B, 2006

Duality in Infinite Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

2005

Menger's theorem for infinite graphs with ends.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

2004

The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

2003

Generating cycles in graphs with at most one end.

[BibT_eX]

[DOI]