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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete mathematics and theoretical computer science Ročník 25:2; číslo Graph Theory
Hlavní autoři:	Dourado, Mitre C., Ponciano, Vitor S., da Silva, Rômulo L. O.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Discrete Mathematics & Theoretical Computer Science 22.03.2024
Témata:	05c85 computer science - computational complexity computer science - discrete mathematics mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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