A Note on Induced Path Decomposition of Graphs

S. Akbari, H. R. Maimani, A. Seify

Let $G$ be a graph of order $n$. The path decomposition of $G$ is a set of disjoint paths, say $\mathcal{P}$, which cover all vertices of $G$. If all paths are induced paths in $G$…