"Corrigendum to ""On the monophonic rank of a graph"" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]"

DOI10.46298/DMTCS.11423MaRDI QIDQ6510353arXivFDO

Authors Mitre C. Dourado

Published in arXiv

Full work available at URL https://doi.org/10.46298/DMTCS.11423

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

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:1 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph.

This page was built for publication: "Corrigendum to ""On the monophonic rank of a graph"" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]"

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510353)