default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Pascal Gollin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Rutger Campbell, Katie Clinch
, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. 33(3): 351-376 (2024)- 2023
- [j13]Rutger Campbell, Marc Distel, J. Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood:
Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. 30(3) (2023) - [j12]J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang:
Counting cliques in 1-planar graphs. Eur. J. Comb. 109: 103654 (2023) - [j11]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Ubiquity of graphs with nowhere-linear end structure. J. Graph Theory 103(3): 564-598 (2023) - [i2]J. Pascal Gollin, Sebastian Wiederrecht:
Odd-Minors I: Excluding small parity breaks. CoRR abs/2304.04504 (2023) - 2022
- [j10]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Topological ubiquity of trees. J. Comb. Theory B 157: 70-95 (2022) - [j9]J. Pascal Gollin, Karl Heuer:
Characterising k-connected sets in infinite graphs. J. Comb. Theory B 157: 451-499 (2022) - [i1]Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. CoRR abs/2206.02395 (2022) - 2021
- [j8]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
Base Partition for Mixed Families of Finitary and Cofinitary Matroids. Comb. 41(1): 31-52 (2021) - [j7]J. Pascal Gollin, Karl Heuer:
An analogue of Edmonds' Branching Theorem for infinite digraphs. Eur. J. Comb. 92: 103182 (2021) - [j6]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. J. Comb. Theory B 149: 16-22 (2021) - [j5]Joshua Erde, J. Pascal Gollin, Attila Joó:
Enlarging vertex-flames in countable digraphs. J. Comb. Theory B 151: 263-281 (2021) - [j4]J. Pascal Gollin, Karl Heuer:
On the infinite Lucchesi-Younger conjecture I. J. Graph Theory 98(1): 27-48 (2021) - [j3]J. Pascal Gollin, Jakob Kneip:
Representations of Infinite Tree Sets. Order 38(1): 79-96 (2021)
2010 – 2019
- 2018
- [j2]J. Pascal Gollin, Karl Heuer:
Infinite end-devouring sets of rays with prescribed start vertices. Discret. Math. 341(7): 2117-2120 (2018) - 2017
- [j1]Johannes Carmesin, J. Pascal Gollin:
Canonical tree-decompositions of a graph that display its k-blocks. J. Comb. Theory B 122: 1-20 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
