Paul Wollan
- 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
- 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
- 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
- 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
- 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