Corrigendum to "On the monophonic rank of a graph" [Discrete Math.
Theor. Comput. Sci. 24:2 (2022) #3]ArticleAuthors: Mitre C. Dourado ; Vitor S. Ponciano

; Rômulo L. O. da Silva
NULL##0000-0002-7391-620X##NULL
Mitre C. Dourado;Vitor S. Ponciano;Rômulo L. O. da Silva
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.
Comment: 6 pages, 2 figures
Volume: vol. 25:2
Section: Graph Theory
Published on: March 22, 2024
Accepted on: November 23, 2023
Submitted on: June 2, 2023
Keywords: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, 05C85