The Closed Knight Tour Problem in Higher Dimensions. - Joshua Erde; Bruno Golénia; Sylvain Golénia (Electron. J. Comb., 2012)

Knight's Tours in Higher Dimensions - Joshua Erde (CoRR, 2012)

Decomposing the cube into paths. - Joshua Erde (Discret. Math., 2014)

An n-in-a-row Game. - Joshua Erde (Integers, 2015)

An $n$-in-a-row Type Game. - Joshua Erde; Mark Walters (Electron. J. Comb., 2016)

A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Martin Merker; Max Pitz; Konstantinos S. Stavropoulos (Discret. Appl. Math., 2017)

Duality Theorems for Blocks and Tangles in Graphs. - Reinhard Diestel; Philipp Eberenz; Joshua Erde (SIAM J. Discret. Math., 2017)

Refining a Tree-Decomposition which Distinguishes Tangles. - Joshua Erde (SIAM J. Discret. Math., 2017)

Non-reconstructible locally finite graphs. - Nathan J. Bowler; Joshua Erde; Peter Heinig; Florian Lehner; Max Pitz (J. Comb. Theory B, 2018)

A unified treatment of linked and lean tree-decompositions. - Joshua Erde (J. Comb. Theory B, 2018)

Structural submodularity and tangles in abstract separation systems. - Reinhard Diestel; Joshua Erde; Daniel Weißauer (J. Comb. Theory A, 2019)

A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors. - Joshua Erde; Daniel Weißauer (SIAM J. Discret. Math., 2019)

Hamilton decompositions of one-ended Cayley graphs. - Joshua Erde; Florian Lehner; Max Pitz (J. Comb. Theory, Ser. B, 2020)

Directed Path-Decompositions. - Joshua Erde (SIAM J. Discret. Math., 2020)

Base Partition for Mixed Families of Finitary and Cofinitary Matroids. - Joshua Erde; J. Pascal Gollin; Attila Joó; Paul Knappe; Max Pitz (Comb., 2021)

Large complete minors in random subgraphs. - Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2021)

Enlarging vertex-flames in countable digraphs. - Joshua Erde; J. Pascal Gollin; Attila Joó (J. Comb. Theory B, 2021)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. - Joshua Erde; J. Pascal Gollin; Attila Joó; Paul Knappe; Max Pitz (J. Comb. Theory B, 2021)

Bounding the Cop Number of a Graph by Its Genus. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Max Pitz (SIAM J. Discret. Math., 2021)

Topological ubiquity of trees. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (J. Comb. Theory B, 2022)

Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. - Joshua Erde; Florian Lehner (J. Graph Theory, 2022)

Planarity and Genus of Sparse Random Bipartite Graphs. - Tuan Anh Do; Joshua Erde; Mihyun Kang (SIAM J. Discret. Math., 2022)

Component Behaviour and Excess of Random Bipartite Graphs Near the Critical Point. - Tuan Anh Do; Joshua Erde; Mihyun Kang; Michael Missethan (Electron. J. Comb., 2023)

Ubiquity of graphs with nowhere-linear end structure. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (J. Graph Theory, 2023)

Ubiquity of locally finite graphs with extensive tree-decompositions. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (Comb. Theory, 2024)

Percolation on irregular high-dimensional product graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2024)

A note on the width of sparse random graphs. - Tuan Anh Do; Joshua Erde; Mihyun Kang (J. Graph Theory, 2024)

Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb., 2024)

Long Cycles in Percolated Expanders. - Maurício Collares; Sahar Diskin; Joshua Erde; Michael Krivelevich (Electron. J. Comb., 2025)

The emergence of a giant rainbow component. - Oliver Cooley; Tuan Anh Do; Joshua Erde; Michael Missethan (Eur. J. Comb., 2025)

Percolation on High-Dimensional Product Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Random Struct. Algorithms, 2025)