On the monophonic rank of a graph

Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva

A set of vertices $S$ of a graph $G$ is $monophonicallyconvex$ if every induced path joining two vertices of $S$ is contained in $S$. The $monophonicconvexhull$ of $S$, $\…