Wollan, Paul

1. Axioms for infinite matroids
   2010/03/20 by Bruhn, Henning, Diestel, Reinhard, Kriesell, Matthias +2 · 3 citations
   #Combinatorics (math.CO) #FOS: Mathematics
2. A New Proof of the Flat Wall Theorem
   2012/07/30 by Kawarabayashi, Ken-ichi, Thomas, Robin, Wollan, Paul · 3 citations
   #Combinatorics (math.CO) #FOS: Mathematics
3. Quickly excluding a non-planar graph
   2020/10/23 by Ken‐ichi Kawarabayashi, Kawarabayashi, Ken-ichi, Robin Thomas +3 · 4 citations
   Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Complexity and Algorithms in Graphs
4. Forcing clique immersions through chromatic number
   2017/03/23 by Gauthier, Gregory, Le, Tien-Nam, Wollan, Paul · 3 citations
   #Combinatorics (math.CO) #FOS: Mathematics
5. Finding topological subgraphs is fixed-parameter tractable
   2010/11/08 by Martin Grohe, Ken‐ichi Kawarabayashi, Grohe, Martin +5 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory
6. The structure of graphs not admitting a fixed immersion
   2013/02/15 by Paul Wollan, Wollan, Paul · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Graph Labeling and Dimension Problems
7. A characterisation of graphs quasi-isometric to K₄-minor-free graphs
   2024/08/27 by Albrechtsen, Sandra, Jacobs, Raphael W., Knappe, Paul +1 · 4 citations
   #05C10 #05C83 #51F30 #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)
8. Immersions in highly edge connected graphs
   2013/05/06 by Dániel Marx, Paul Wollan, Marx, Daniel +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Interconnection Networks and Systems
9. Rooted grid minors
   2013/07/30 by Marx, Dániel, Seymour, Paul, Wollan, Paul · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
10. A structure theorem for strong immersions
    2014/11/03 by Zdenĕk Dvořák, Dvorak, Zdenek, Paul Wollan +1 · 1 citation
    Computer Science · Mathematics · #05C75 (Primary) 05C40 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
11. Half-integral linkages in highly connected directed graphs
    2016/11/03 by Edwards, Katherine, Muzi, Irene, Wollan, Paul · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
12. A grid theorem for strong immersions of walls
    2023/01/12 by Diestel, Reinhard, Jacobs, Raphael W., Knappe, Paul +1 · 1 citation
    #05C40 #05C75 #05C83 #Combinatorics (math.CO) #FOS: Mathematics
13. Small hitting sets for longest paths and cycles
    2025/05/13 by Norin, Sergey, Steiner, Raphael, Thomassé, Stephan +1 · 3 citations
    #05C38 #05C69 #Combinatorics (math.CO) #FOS: Mathematics
14. A structural duality for path-decompositions into parts of small radius
    2023/07/17 by Albrechtsen, Sandra, Diestel, Reinhard, Elm, Ann-Kathrin +4 · 1 citation
    #05C10 (Primary) 05C75 #05C12 #05C62 #05C83 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics