Agelos Georgakopoulos

Christoforos Panagiotis

Comb. Probab. Comput., November, 2023

The planar Cayley graphs are effectively enumerable II.

[BibT_eX]

[DOI]

Matthias Hamann

Eur. J. Comb., May, 2023

2022

The power of two choices for random walks.

[BibT_eX]

[DOI]

Thomas Sauerwald

John Sylvester

Comb. Probab. Comput., 2022

2021

Invariant spanning double rays in amenable groups.

[BibT_eX]

[DOI]

Florian Lehner

Discret. Math., 2021

2020

Every planar graph with the Liouville property is amenable.

[BibT_eX]

[DOI]

Johannes Carmesin

Random Struct. Algorithms, 2020

Percolation on an infinitely generated group.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

Choice and Bias in Random Walks.

[BibT_eX]

[DOI]

Thomas Sauerwald

John Sylvester

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Forcing large tight components in 3-graphs.

[BibT_eX]

[DOI]

Richard Montgomery

Eur. J. Comb., 2019

The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs.

[BibT_eX]

[DOI]

Matthias Hamann

Comb., 2019

2018

The Bradley-Terry condition is L1-testable.

[BibT_eX]

[DOI]

Konstantinos Tyros

Discret. Math., 2018

Subcritical Graph Classes Containing All Planar Graphs.

[BibT_eX]

[DOI]

Stephan Wagner

Comb. Probab. Comput., 2018

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time.

[BibT_eX]

[DOI]

Stephen Alstrup

Eva Rotenberg

Carsten Thomassen

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Hitting Times, Cover Cost, and the Wiener Index of a Tree.

[BibT_eX]

[DOI]

Stephan Wagner

J. Graph Theory, 2017

The planar cubic Cayley graphs of connectivity 2.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

On covers of graphs by Cayley graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Hyperbolicity vs. Amenability for Planar Graphs.

[BibT_eX]

[DOI]

Bruno Federici

Discret. Comput. Geom., 2017

2014

Characterising planar Cayley graphs and Cayley complexes in terms of group presentations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

New Bounds for Edge-Cover by Random Walk.

[BibT_eX]

[DOI]

Peter Winkler

Comb. Probab. Comput., 2014

2013

Delay Colourings of Cubic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Two-Color Babylon.

[BibT_eX]

[DOI]

Peter Winkler

Integers, 2012

A Tractable Variant of Cover Time

[BibT_eX]

[DOI]

CoRR, 2012

2011

The Max-Flow Min-Cut theorem for countable networks.

[BibT_eX]

[DOI]

Ron Aharoni

Eli Berger

Amitai Perlstein

J. Comb. Theory, Ser. B, 2011

Graph topologies induced by edge lengths.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

An Eberhard-Like Theorem for Pentagons and Heptagons.

[BibT_eX]

[DOI]

Matt DeVos

Bojan Mohar

Robert Sámal

Discret. Comput. Geom., 2010

2009

Every rayless graph has an unfriendly partition.

[BibT_eX]

[DOI]

Henning Bruhn

Reinhard Diestel

Electron. Notes Discret. Math., 2009

Perfect matchings in r-partite r-graphs.

[BibT_eX]

[DOI]

Ron Aharoni

Eur. J. Comb., 2009

A short proof of Fleischner's theorem.

[BibT_eX]

[DOI]

Discret. Math., 2009

Geodetic Topological Cycles in Locally Finite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Topological Circles and Euler Tours in Locally Finite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Strongly Maximal Matchings in Infinite Graphs.

[BibT_eX]

[DOI]

Ron Aharoni

Eli Berger

Electron. J. Comb., 2008

2007

Topological paths and cycles in infinite graphs (Topologische Wege und Kreise in unendlichen Graphen)

[BibT_eX]

[DOI]

PhD thesis, 2007

Connected but not path-connected subspaces of infinite graphs.

[BibT_eX]

[DOI]