Non-empty intersection of longest paths in $P_5$-free and claw-free graphs

Paloma T. Lima, Amir Nikabadi

A family $\mathcal{F}$ of graphs is a \textit{Gallai family} if for every connected graph $G\in \mathcal{F}$, all longest paths in $G$ have a common vertex. While it is not known w…