Pat Morin

collaborators

3 papers

cs.CG2025

Free Sets in Planar Graphs: History and Applications

Vida DujmoviÄ, Pat Morin

A subset $S$ of vertices in a planar graph $G$ is a free set if, for every set $P$ of $∣ S ∣$ points in the plane, there exists a straight-line crossing-free drawing of $G$ in which…

math.CO2025

Separation Number and Treewidth, Revisited

Hussein Houdrouge, Babak Miraftab, Pat Morin

We give a constructive proof of the fact that the treewidth of a graph $G$ is bounded by a linear function of the separation number of $G$ .

math.CO2024

Tight bound for the ErdÅs-PÃ³sa property of tree minors

Vida DujmoviÄ, GwenaÃ«l Joret, Piotr Micek +1

Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$ , either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ mi…

Free Sets in Planar Graphs: History and Applications

Separation Number and Treewidth, Revisited

Tight bound for the ErdÅs-PÃ³sa property of tree minors

Tight bound for the ErdÅs-PÃ³sa property of tree minors