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

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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 25:2; H. Graph Theory
Hauptverfasser:	Dourado, Mitre C., Ponciano, Vitor S., da Silva, Rômulo L. O.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Discrete Mathematics & Theoretical Computer Science 22.03.2024
Schlagworte:	05c85 computer science - computational complexity computer science - discrete mathematics mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1365-8050 1365-8050
DOI:	10.46298/dmtcs.11423