Jochen Pascal Gollin

According to our database, Jochen Pascal Gollin authored at least 26 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Minimal toughness in subclasses of weakly chordal graphs.

Jochen Pascal Gollin, Martin Milanic, Laura Ogrin

CoRR, March, 2026

The Erdős-Pósa property for circle graphs as vertex-minors.

Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Dominated balanced separators in wheel-induced-minor-free graphs.

Maria Chudnovsky, Jochen Pascal Gollin, Matjaz Krnc, Martin Milanic

CoRR, December, 2025

On graphs with a simple structure of maximal cliques.

Jochen Pascal Gollin, Meike Hatzel, Sebastian Wiederrecht

CoRR, April, 2025

Optimal bounds for zero-sum cycles. I. Odd order.

Rutger Campbell, Jochen Pascal Gollin, Kevin Hendrey, Raphael Steiner

J. Comb. Theory B, 2025

Linear Bounds on Treewidth in Terms of Excluded Planar Minors.

Jochen Pascal Gollin, Kevin Hendrey, Sang-il Oum, Bruce Reed

Electron. J. Comb., 2025

Clustered Colouring of Graph Products.

Rutger Campbell, Jochen Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, Jane Tan, David R. Wood

Electron. J. Comb., 2025

A coarse Erdős-Pósa theorem.

Jungho Ahn, Jochen Pascal Gollin, Tony Huynh, O-joung Kwon

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

On {k}-Roman graphs.

Kenny Storgel, Nina Chiarelli, Lara Fernández, Jochen Pascal Gollin, Claire Hilaire, Valeria Leoni, Martin Milanic

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024

Product structure of graph classes with bounded treewidth.

Rutger Campbell, Katie Clinch, Marc Distel, Jochen Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood

Comb. Probab. Comput., 2024

Ubiquity of locally finite graphs with extensive tree-decompositions.

Nathan J. Bowler, Christian Elbracht, Joshua Erde, Jochen Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

Comb. Theory, 2024

2023

Ubiquity of graphs with nowhere-linear end structure.

Nathan J. Bowler, Christian Elbracht, Joshua Erde, Jochen Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

J. Graph Theory, July, 2023

Counting cliques in 1-planar graphs.

Jochen Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang

Eur. J. Comb., 2023

Odd-Minors I: Excluding small parity breaks.

Jochen Pascal Gollin, Sebastian Wiederrecht

CoRR, 2023

Graphs of Linear Growth have Bounded Treewidth.

Rutger Campbell, Marc Distel, Jochen Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood

Electron. J. Comb., 2023

2022

Characterising <i>k</i>-connected sets in infinite graphs.

Jochen Pascal Gollin, Karl Heuer

J. Comb. Theory B, 2022

Topological ubiquity of trees.

Nathan J. Bowler, Christian Elbracht, Joshua Erde, Jochen Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

J. Comb. Theory B, 2022

Disjoint dijoins for classes of dicuts in finite and infinite digraphs.

Jochen Pascal Gollin, Karl Heuer, Konstantinos Stavropoulos

Comb. Theory, 2022

2021

Representations of Infinite Tree Sets.

Jochen Pascal Gollin, Jakob Kneip

Order, 2021

On the infinite Lucchesi-Younger conjecture I.

Jochen Pascal Gollin, Karl Heuer

J. Graph Theory, 2021

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs.

Joshua Erde, Jochen Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz

J. Comb. Theory B, 2021

Enlarging vertex-flames in countable digraphs.

Joshua Erde, Jochen Pascal Gollin, Attila Joó

J. Comb. Theory B, 2021

An analogue of Edmonds' Branching Theorem for infinite digraphs.

Jochen Pascal Gollin, Karl Heuer

Eur. J. Comb., 2021

Base Partition for Mixed Families of Finitary and Cofinitary Matroids.

Joshua Erde, Jochen Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz

Comb., 2021

2018

Infinite end-devouring sets of rays with prescribed start vertices.

Jochen Pascal Gollin, Karl Heuer

Discret. Math., 2018

2017

Canonical tree-decompositions of a graph that display its k-blocks.

Johannes Carmesin, Jochen Pascal Gollin

J. Comb. Theory B, 2017