Corrigendum to: “On the monophonic rank of a graph”. (English) Zbl 07908426
Summary: In this corrigendum, we give a counterexample to Theorem 5.2 in our paper [ibid. 24, No. 2, Paper No. 3, 14 p. (2022; Zbl 1515.05054)]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph.
MSC:
| 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.) |
Citations:
Zbl 1515.05054References:
| [1] | A. A. Ageev. On finding critical independent and vertex sets. SIAM Journal on Discrete Mathematics, 7 (2):293-295, 1994. doi: 10.1137/S0895480191217569. · Zbl 0798.05050 · doi:10.1137/S0895480191217569 |
| [2] | M. R. Cerioli and J. L. Szwarcfiter. Characterizing intersection graphs of substars of a star. Ars Combi-natoria, 79:21-31, 2006. · Zbl 1141.05332 |
| [3] | M. C. Dourado, V. S. Ponciano, and R. L. O. da Silva. On the monophonic rank of a graph. Discrete Mathematics & Theoretical Computer Science, 24(2), 2022. doi: 10.46298/dmtcs.6835. · Zbl 1515.05054 · doi:10.46298/dmtcs.6835 |
| [4] | J. Gustedt. On the pathwidth of chordal graphs. Discrete Applied Mathematics, 45(3):233-248, 1993. · Zbl 0798.68134 |
| [5] | S.-L. Peng, C. Y. Tang, M.-T. Ko, C.-W. Ho, and T.-s. Hsu. Graph searching on some subclasses of chordal graphs. Algorithmica, 27:395-426, 2000. · Zbl 0955.05074 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
