Pat Morin

collaborators

2 papers

math.CO2026

Excluding an apex-forest or a fan as quickly as possible

Quentin Claus, JÄdrzej Hodor, GwenaÃ«l Joret +1

We show that every graph $G$ excluding an apex-forest $H$ as a minor has layered pathwidth at most $∣ V (H) ∣ - 2$ , and that every graph $G$ excluding an apex-linear forest (such as a f…

math.CO2026

Basis Number and Pathwidth

Babak Miraftab, Pat Morin, Yelena Yuditsky

We prove two results relating the basis number of a graph $G$ to path decompositions of $G$ . Our first result shows that the basis number of a graph is at most four times its pathw…