All-path convexity: Combinatorial and complexity aspects

Fábio Protti, João V. C. Thompson

Let $\P$ be any collection of paths of a graph $G=(V,E)$. For $S\subseteq V$, define $I(S)=S\cup\{v\mid v \ \mbox{lies in a path of} \ ¶\ \mbox{with endpoints in} \ S\}$. Let $\C$ b…