Canonical tree-decompositions of a graph that display its k-blocks. - Johannes Carmesin; J. Pascal Gollin (J. Comb. Theory B, 2017)

Infinite end-devouring sets of rays with prescribed start vertices. - J. Pascal Gollin; Karl Heuer (Discret. Math., 2018)

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

An analogue of Edmonds' Branching Theorem for infinite digraphs. - J. Pascal Gollin; Karl Heuer (Eur. J. Comb., 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)

On the infinite Lucchesi-Younger conjecture I. - J. Pascal Gollin; Karl Heuer (J. Graph Theory, 2021)

Representations of Infinite Tree Sets. - J. Pascal Gollin; Jakob Kneip (Order, 2021)

Disjoint dijoins for classes of dicuts in finite and infinite digraphs. - J. Pascal Gollin; Karl Heuer; Konstantinos Stavropoulos (Comb. Theory, 2022)

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)

Characterising k-connected sets in infinite graphs. - J. Pascal Gollin; Karl Heuer (J. Comb. Theory B, 2022)

Graphs of Linear Growth have Bounded Treewidth. - Rutger Campbell; Marc Distel; J. Pascal Gollin; Daniel J. Harvey; Kevin Hendrey; Robert Hickingbotham; Bojan Mohar; David R. Wood (Electron. J. Comb., 2023)

Odd-Minors I: Excluding small parity breaks. - J. Pascal Gollin; Sebastian Wiederrecht (CoRR, 2023)

Counting cliques in 1-planar graphs. - J. Pascal Gollin; Kevin Hendrey; Abhishek Methuku; Casey Tompkins; Xin Zhang (Eur. 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)

Product structure of graph classes with bounded treewidth. - Rutger Campbell; Katie Clinch; Marc Distel; J. Pascal Gollin; Kevin Hendrey; Robert Hickingbotham; Tony Huynh; Freddie Illingworth; Youri Tamitegama; Jane Tan; David R. Wood (Comb. Probab. Comput., 2024)

A coarse Erdős-Pósa theorem. - Jungho Ahn; J. Pascal Gollin; Tony Huynh; O-joung Kwon (SODA, 2025)

Clustered Colouring of Graph Products. - Rutger Campbell; J. Pascal Gollin; Kevin Hendrey; Thomas Lesgourgues; Bojan Mohar; Youri Tamitegama; Jane Tan; David R. Wood (Electron. J. Comb., 2025)

Optimal bounds for zero-sum cycles. I. Odd order. - Rutger Campbell; J. Pascal Gollin; Kevin Hendrey; Raphael Steiner (J. Comb. Theory B, 2025)

On graphs with a simple structure of maximal cliques. - J. Pascal Gollin; Meike Hatzel; Sebastian Wiederrecht (CoRR, 2025)