Ubiquity of graphs with nowhere‐linear end structure von Bowler, Nathan, Elbracht, Christian, Erde, Joshua, Gollin, J. Pascal, Heuer, Karl, Pitz, Max, Teegen, Maximilian

Volltext

Representations of Infinite Tree Sets von Gollin, J. Pascal, Kneip, Jakob

Volltext

On the infinite Lucchesi–Younger conjecture I von Gollin, J. Pascal, Heuer, Karl

Volltext

An analogue of Edmonds’ Branching Theorem for infinite digraphs von Pascal Gollin, J., Heuer, Karl

Volltext

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs von Erde, Joshua, Pascal Gollin, J., Joó, Atilla, Knappe, Paul, Pitz, Max

Volltext

Base Partition for Mixed Families of Finitary and Cofinitary Matroids von Erde, Joshua, Gollin, J. Pascal, Joó, Attila, Knappe, Paul, Pitz, Max

Volltext

Characterising k-connected sets in infinite graphs von Gollin, J. Pascal, Heuer, Karl

Volltext

Matching variables to equations in infinite linear equation systems von Gollin, J. Pascal, Joó, Attila

Volltext

Infinite end-devouring sets of rays with prescribed start vertices von Gollin, J. Pascal, Heuer, Karl

Volltext

Canonical tree-decompositions of a graph that display its k-blocks von Carmesin, Johannes, Gollin, J. Pascal

Volltext

Enlarging vertex-flames in countable digraphs von Erde, Joshua, Gollin, J. Pascal, Joó, Attila

Volltext

Disjoint dijoins for classes of dicuts in finite and infinite digraphs von Gollin, J. Pascal, Heuer, Karl, Stavropoulos, Konstantinos

Volltext

Topological ubiquity of trees von Bowler, Nathan, Elbracht, Christian, Erde, Joshua, Gollin, J. Pascal, Heuer, Karl, Pitz, Max, Teegen, Maximilian

Volltext

Counting cliques in 1-planar graphs von Gollin, J. Pascal, Hendrey, Kevin, Methuku, Abhishek, Tompkins, Casey, Zhang, Xin

Volltext

Product structure of graph classes with bounded treewidth von Campbell, Rutger, Clinch, Katie, Distel, Marc, Gollin, J. Pascal, Hendrey, Kevin, Hickingbotham, Robert, Huynh, Tony, Illingworth, Freddie, Tamitegama, Youri, Tan, Jane, Wood, David R.

Volltext

Ubiquity of locally finite graphs with extensive tree-decompositions von Bowler, Nathan, Elbracht, Christian, Erde, Joshua, Gollin, J. Pascal, Heuer, Karl, Pitz, Max, Teegen, Maximilian

Volltext

Obstructions for bounded branch-depth in matroids von J Pascal Gollin, Hendrey, Kevin, Mayhew, Dillon, Sang-il Oum

Volltext

Graphs of Linear Growth have Bounded Treewidth von Campbell, Rutger, Distel, Marc, Gollin, J. Pascal, Harvey, Daniel J., Hendrey, Kevin, Hickingbotham, Robert, Mohar, Bojan, Wood, David

Volltext

A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups von Gollin, J. Pascal, Hendrey, Kevin, Kawarabayashi, Ken‐ichi, Kwon, O‐joung, Oum, Sang‐il

Volltext

Obstructions for Bounded Branch-depth in Matroids von Gollin, Jochen Pascal, Hendrey, Kevin, Mayhew, Dillon, Oum, Sang-il

Volltext