Pascal Gollin

most citedUbiquity in graphs I: Topological ubiquity of trees

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

collaborators

3 papers

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…

math.CO2018

Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure

Nathan Bowler, Christian Elbracht, Joshua Erde +4

A graph $G$ is said to be $⪯$ -ubiquitous, where $⪯$ is the minor relation between graphs, if whenever $Γ$ is a graph with $n G ⪯ Γ$ for all $n \in N$ , the…

math.CO2018★ 1 cited

Ubiquity in graphs I: Topological ubiquity of trees

Nathan Bowler, Christian Elbracht, Joshua Erde +4

Let $◃$ be a relation between graphs. We say a graph $G$ is \emph{ $◃$ -ubiquitous} if whenever $Γ$ is a graph with $n G ◃ Γ$ for all $n \in \mathb…