Follow
J. Pascal Gollin
J. Pascal Gollin
Verified email at famnit.upr.si - Homepage
Title
Cited by
Cited by
Year
Representations of infinite tree-sets
JP Gollin, J Kneip
arXiv preprint arXiv:1908.10327, 2019
292019
Product structure of graph classes with bounded treewidth
R Campbell, K Clinch, M Distel, JP Gollin, K Hendrey, R Hickingbotham, ...
Combinatorics, Probability and Computing 33 (3), 351-376, 2024
182024
Characterising k-connected sets in infinite graphs
JP Gollin, K Heuer
Journal of Combinatorial Theory, Series B 157, 451-499, 2022
18*2022
Topological ubiquity of trees
N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen
Journal of Combinatorial Theory, Series B 157, 70-95, 2022
18*2022
Canonical tree-decompositions of a graph that display its k-blocks
J Carmesin, JP Gollin
Journal of Combinatorial Theory, Series B 122, 1-20, 2017
162017
Ubiquity of graphs with nowhere‐linear end structure
N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen
Journal of Graph Theory, 2023
13*2023
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
JP Gollin, K Hendrey, K Kawarabayashi, O Kwon, S Oum
arXiv preprint arXiv:2102.01986, 2021
112021
A unified Erd\H {o} sP\'{o} sa theorem for cycles in graphs labelled by multiple abelian groups
JP Gollin, K Hendrey, O Kwon, S Oum, Y Yoo
arXiv preprint arXiv:2209.09488, 2022
82022
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen
arXiv preprint arXiv:2012.13070, 2020
72020
Counting cliques in 1-planar graphs
JP Gollin, K Hendrey, A Methuku, C Tompkins, X Zhang
European Journal of Combinatorics 109, 103654, 2023
62023
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
J Erde, JP Gollin, A Joó, P Knappe, M Pitz
Journal of Combinatorial Theory, Series B 149, 16-22, 2021
62021
Base partition for mixed families of finitary and cofinitary matroids
J Erde, JP Gollin, A Joó, P Knappe, M Pitz
Combinatorica, 1-22, 2020
62020
Obstructions for bounded branch-depth in matroids
JP Gollin, K Hendrey, D Mayhew, S Oum
arXiv preprint arXiv:2003.13975, 2020
62020
Graphs of Linear Growth have Bounded Treewidth
R Campbell, M Distel, JP Gollin, DJ Harvey, K Hendrey, R Hickingbotham, ...
arXiv preprint arXiv:2210.13720, 2022
32022
Enlarging vertex-flames in countable digraphs
J Erde, JP Gollin, A Joó
Journal of Combinatorial Theory, Series B 151, 263-281, 2021
32021
On the infinite Lucchesi–Younger conjecture I
JP Gollin, K Heuer
Journal of Graph Theory 98 (1), 27-48, 2021
32021
An analogue of Edmonds’ Branching Theorem for infinite digraphs
JP Gollin, K Heuer
European Journal of Combinatorics 92, 103182, 2021
32021
Infinite end-devouring sets of rays with prescribed start vertices
JP Gollin, K Heuer
Discrete Mathematics 341 (7), 2117-2120, 2018
32018
Ubiquity of locally finite graphs with extensive tree-decompositions
N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen
Combinatorial Theory 4 (2), 2024
22024
Clustered Colouring of Graph Products
R Campbell, JP Gollin, K Hendrey, T Lesgourgues, B Mohar, ...
arXiv preprint arXiv:2407.21360, 2024
12024
The system can't perform the operation now. Try again later.
Articles 1–20