J. Pascal Gollin

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Linear bounds on treewidth in terms of excluded planar minors
(available as arXiv preprint)
N/APaper
Product structure of graph classes with bounded treewidth
Combinatorics, Probability and Computing
2024-11-05Paper
Product structure of graph classes with bounded treewidth2024-10-31Paper
Ubiquity of locally finite graphs with extensive tree-decompositions
Combinatorial Theory
2024-10-08Paper
A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
Journal of the London Mathematical Society
2024-02-23Paper
Ubiquity of graphs with nowhere‐linear end structure
Journal of Graph Theory
2023-10-12Paper
On the infinite Lucchesi–Younger conjecture I
Journal of Graph Theory
2023-10-04Paper
Graphs of linear growth have bounded treewidth
The Electronic Journal of Combinatorics
2023-08-10Paper
Odd-Minors I: Excluding small parity breaks2023-04-10Paper
Matching variables to equations in infinite linear equation systems
Linear Algebra and its Applications
2023-01-04Paper
Counting cliques in 1-planar graphs
European Journal of Combinatorics
2022-12-28Paper
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
Combinatorial Theory
2022-11-23Paper
Topological ubiquity of trees
Journal of Combinatorial Theory. Series B
2022-09-23Paper
Characterising \(k\)-connected sets in infinite graphs
Journal of Combinatorial Theory. Series B
2022-09-23Paper
A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups2022-09-20Paper
Product structure of graph classes with bounded treewidth2022-06-06Paper
Obstructions for bounded branch-depth in matroids
Advances in Combinatorics
2021-11-05Paper
Enlarging vertex-flames in countable digraphs
Journal of Combinatorial Theory. Series B
2021-09-16Paper
Base partition for mixed families of finitary and cofinitary matroids
Combinatorica
2021-06-29Paper
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Journal of Combinatorial Theory. Series B
2021-06-18Paper
Representations of infinite tree sets
Order
2021-04-16Paper
An analogue of Edmonds' branching theorem for infinite digraphs
European Journal of Combinatorics
2021-02-08Paper
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions2020-12-23Paper
Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure2018-09-03Paper
Infinite end-devouring sets of rays with prescribed start vertices
Discrete Mathematics
2018-05-24Paper
Canonical tree-decompositions of a graph that display its k-blocks
Journal of Combinatorial Theory. Series B
2016-11-25Paper


Research outcomes over time


This page was built for person: J. Pascal Gollin