Gollin, J. Pascal
- Optimal bounds for zero-sum cycles. I. Odd order
2024/06/28 by Campbell, Rutger, Gollin, J. Pascal, Hendrey, Kevin +1 · 3 citations
#05C20 #05C22 #05C25 #05C38 #05C83 #05E15 #Combinatorics (math.CO) #FOS: Mathematics
- A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
2022/09/20 by Gollin, J. Pascal, Hendrey, Kevin, Kwon, O-joung +2 · 1 citation
#05C25 #05C38 #05C70 #05C78 #Combinatorics (math.CO) #FOS: Mathematics
- Treewidth, Hadwiger Number, and Induced Minors
2024/10/25 by Rutger Campbell, James Davies, Campbell, Rutger +17 · 4 citations
Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #semigroups and automata theory
- Enlarging vertex-flames in countable digraphs
2020/03/13 by Erde, Joshua, Gollin, J. Pascal, Joó, Attila · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
- Linear bounds on treewidth in terms of excluded planar minors
2024/02/27 by Gollin, J. Pascal, Hendrey, Kevin, Oum, Sang-il +1 · 1 citation
#05C83 #Combinatorics (math.CO) #FOS: Mathematics
- Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
2023/04/10 by Gollin, J. Pascal, Wiederrecht, Sebastian · 1 citation
#05C75 #05C83 #05C85 #68Q27 #68R10 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- On graphs with a simple structure of maximal cliques
2025/04/23 by J. Pascal Gollin, Gollin, J. Pascal, Meike Hatzel +3 · 2 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Complexity and Algorithms in Graphs