The following pages link to J. Pascal Gollin (Q345065):
Displaying 22 items.
- Canonical tree-decompositions of a graph that display its \(k\)-blocks (Q345066) (← links)
- Infinite end-devouring sets of rays with prescribed start vertices (Q1752692) (← links)
- Enlarging vertex-flames in countable digraphs (Q1984520) (← links)
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907) (← links)
- Base partition for mixed families of finitary and cofinitary matroids (Q2036617) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Topological ubiquity of trees (Q2171012) (← links)
- Characterising \(k\)-connected sets in infinite graphs (Q2171028) (← links)
- An analogue of Edmonds' branching theorem for infinite digraphs (Q2225436) (← links)
- Representations of infinite tree sets (Q2663170) (← links)
- Matching variables to equations in infinite linear equation systems (Q2680587) (← links)
- Disjoint dijoins for classes of dicuts in finite and infinite digraphs (Q5051459) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- On the infinite Lucchesi–Younger conjecture I (Q6056771) (← links)
- Ubiquity of graphs with nowhere‐linear end structure (Q6074597) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
- Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure (Q6306166) (← links)
- Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions (Q6356858) (← links)
- Product structure of graph classes with bounded treewidth (Q6401220) (← links)
- A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups (Q6411312) (← links)
- Odd-Minors I: Excluding small parity breaks (Q6432619) (← links)
