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

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

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. Comment: 6 pages, 2 figures

Keywords

• Mathematics - Combinatorics
• Computer Science - Computational Complexity
• Computer Science - Discrete Mathematics
• 05C85

Mathematics Subject Classification 2020

• 05C10 - Planar graphs; geometric and topological aspects of graph theory
• 05C85 - Graph algorithms (graph-theoretic aspects)
• 68Q17 - Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Preview

Loading PDF preview...