J. Pascal Gollin

Citace

	Všechny	Od 2020
Citace	193	168
h-index	8	8
i10-index	7	7

2017201820192020202120222023202420251 8 9 17 14 19 35 64 14

Veřejný přístup

Zobrazit všechny

11 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Karl HeuerAssistant Professor at the AlgoLoG section, Technical University of Denmark, Kgs. Lyngby, DenmarkE-mailová adresa ověřena na: daad-alumni.de
Joshua ErdeTU GrazE-mailová adresa ověřena na: math.tugraz.at
Max PitzUniversität HamburgE-mailová adresa ověřena na: uni-hamburg.de
Sang-il OumDistinguished Research Fellow / CI. Discrete Mathematics Group, Institute for Basic ScienceE-mailová adresa ověřena na: ibs.re.kr
David R. WoodSchool of Mathematics, Monash UniversityE-mailová adresa ověřena na: monash.edu
Tony HuynhDepartment of Computer Science, Sapienza University of RomeE-mailová adresa ověřena na: di.uniroma1.it
Robert HickingbothamENS Lyon, LIP, FranceE-mailová adresa ověřena na: ens-lyon.fr
O-joung KwonHanyang UniversityE-mailová adresa ověřena na: hanyang.ac.kr
Attila JoóUniversity of HamburgE-mailová adresa ověřena na: uni-hamburg.de
Paul KnappeDoctoral student, Universität HamburgE-mailová adresa ověřena na: uni-hamburg.de
Bojan MoharSimon Fraser University and IMFME-mailová adresa ověřena na: sfu.ca
Katie ClinchUniversity of New South WalesE-mailová adresa ověřena na: unsw.edu.au
Freddie IllingworthPostdoc, University of OxfordE-mailová adresa ověřena na: maths.ox.ac.uk
Johannes CarmesinFull Professor, TU FreibergE-mailová adresa ověřena na: math.tu-freiberg.de
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoE-mailová adresa ověřena na: nii.ac.jp
Casey TompkinsAlfréd Rényi Institute of Mathematics, BudapestE-mailová adresa ověřena na: renyi.hu
Abhishek MethukuUniversity of Illinois Urbana-ChampaignE-mailová adresa ověřena na: illinois.edu
Dillon MayhewUniversity of LeedsE-mailová adresa ověřena na: leeds.ac.uk
Sebastian WiederrechtAssistant Professor, KAIST, South KoreaE-mailová adresa ověřena na: kaist.ac.kr
Bruce ReedMcGill UniversityE-mailová adresa ověřena na: cs.mcgill.ca

Sledovat

J. Pascal Gollin

University of Primorska

E-mailová adresa ověřena na: famnit.upr.si - Domovská stránka

graph theory


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Representations of infinite tree-sets JP Gollin, J Kneip arXiv preprint arXiv:1908.10327, 2019	28	2019
Product structure of graph classes with bounded treewidth R Campbell, K Clinch, M Distel, JP Gollin, K Hendrey, R Hickingbotham, ... Combinatorics, Probability and Computing 33 (3), 351-376, 2024	19	2024
Topological ubiquity of trees N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen Journal of Combinatorial Theory, Series B 157, 70-95, 2022	19*	2022
Characterising k-connected sets in infinite graphs JP Gollin, K Heuer Journal of Combinatorial Theory, Series B 157, 451-499, 2022	18*	2022
Canonical tree-decompositions of a graph that display its k-blocks J Carmesin, JP Gollin Journal of Combinatorial Theory, Series B 122, 1-20, 2017	17	2017
Ubiquity of graphs with nowhere‐linear end structure N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen Journal of Graph Theory, 2023	13*	2023
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups JP Gollin, K Hendrey, K Kawarabayashi, O Kwon, S Oum arXiv preprint arXiv:2102.01986, 2021	11	2021
A unified Erd\H {o} sP\'{o} sa theorem for cycles in graphs labelled by multiple abelian groups JP Gollin, K Hendrey, O Kwon, S Oum, Y Yoo arXiv preprint arXiv:2209.09488, 2022	8	2022
Counting cliques in 1-planar graphs JP Gollin, K Hendrey, A Methuku, C Tompkins, X Zhang European Journal of Combinatorics 109, 103654, 2023	7	2023
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen arXiv preprint arXiv:2012.13070, 2020	7	2020
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs J Erde, JP Gollin, A Joó, P Knappe, M Pitz Journal of Combinatorial Theory, Series B 149, 16-22, 2021	6	2021
Base partition for mixed families of finitary and cofinitary matroids J Erde, JP Gollin, A Joó, P Knappe, M Pitz Combinatorica, 1-22, 2020	6	2020
Obstructions for bounded branch-depth in matroids JP Gollin, K Hendrey, D Mayhew, S Oum arXiv preprint arXiv:2003.13975, 2020	6	2020
Ubiquity of locally finite graphs with extensive tree-decompositions N Bowler, C Elbracht, J Erde, JP Gollin, K Heuer, M Pitz, M Teegen Combinatorial Theory 4 (2), 2024	3	2024
Graphs of Linear Growth have Bounded Treewidth R Campbell, M Distel, JP Gollin, DJ Harvey, K Hendrey, R Hickingbotham, ... arXiv preprint arXiv:2210.13720, 2022	3	2022
Enlarging vertex-flames in countable digraphs J Erde, JP Gollin, A Joó Journal of Combinatorial Theory, Series B 151, 263-281, 2021	3	2021
On the infinite Lucchesi–Younger conjecture I JP Gollin, K Heuer Journal of Graph Theory 98 (1), 27-48, 2021	3	2021
An analogue of Edmonds’ Branching Theorem for infinite digraphs JP Gollin, K Heuer European Journal of Combinatorics 92, 103182, 2021	3	2021
Infinite end-devouring sets of rays with prescribed start vertices JP Gollin, K Heuer Discrete Mathematics 341 (7), 2117-2120, 2018	3	2018
A coarse Erdős-Pósa theorem J Ahn, JP Gollin, T Huynh, O Kwon Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025	2	2025

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři