The power of two choices for random walks. | 0 | 0.34 | 2022 |

Choice and Bias in Random Walks. | 0 | 0.34 | 2020 |

The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs | 0 | 0.34 | 2019 |

Forcing large tight components in 3-graphs. | 0 | 0.34 | 2019 |

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. | 0 | 0.34 | 2018 |

The Bradley-Terry condition is L1-testable. | 0 | 0.34 | 2018 |

Subcritical Graph Classes Containing All Planar Graphs. | 0 | 0.34 | 2018 |

Hyperbolicity vs. Amenability for planar graphs | 0 | 0.34 | 2017 |

The planar cubic Cayley graphs of connectivity 2 | 2 | 0.52 | 2017 |

Hitting Times, Cover Cost, and the Wiener Index of a Tree | 7 | 0.68 | 2017 |

On covers of graphs by Cayley graphs | 0 | 0.34 | 2017 |

Characterising planar Cayley graphs and Cayley complexes in terms of group presentations | 3 | 0.53 | 2014 |

Delay Colourings of Cubic Graphs. | 0 | 0.34 | 2013 |

A Tractable Variant of Cover Time | 2 | 0.42 | 2012 |

New Bounds for Edge-Cover by Random Walk. | 0 | 0.34 | 2011 |

The Max-Flow Min-Cut theorem for countable networks | 6 | 0.44 | 2011 |

Two-Color Babylon | 0 | 0.34 | 2011 |

Graph topologies induced by edge lengths | 6 | 0.87 | 2011 |

An Eberhard-Like Theorem for Pentagons and Heptagons | 1 | 0.46 | 2010 |

Every rayless graph has an unfriendly partition | 3 | 0.54 | 2010 |

A short proof of Fleischner's theorem | 6 | 0.68 | 2009 |

Topological circles and Euler tours in locally finite graphs | 5 | 0.48 | 2009 |

Geodetic Topological Cycles in Locally Finite Graphs. | 8 | 0.58 | 2009 |

Perfect matchings in r-partite r-graphs | 17 | 1.47 | 2009 |

Strongly Maximal Matchings in Infinite Graphs. | 0 | 0.34 | 2008 |