Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
Mitre C. Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva
TL;DR
This corrigendum gives a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" and presents a polynomial-time algorithm for computing the monophonic rank of a starlike graph.
Abstract
In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph.
