◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Pascal Gollin

3 papers hereh-index 318 citations3 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2

Across the 2 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO2
  • cs.CC1

identity via Semantic Scholar / OpenAlex

most citedUbiquity in graphs I: Topological ubiquity of trees

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026

W[1]-Hardness of Upper Clique Transversal

J. Pascal Gollin, Pascal J. Gollin, Tesshu Hanaka +3

A clique transversal of a graph is a set of vertices intersecting every maximal clique. We prove that deciding whether a graph has an inclusion-wise minimal clique transversal of s…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.