On Camby–Plein’s characterization of domination perfect graphs
Discrete Applied Mathematics · 2026-10 · 391 · 15-23
DOI: 10.1016/j.dam.2026.04.021 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-10. Verfasst von Vadim Zverovich. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We show that all results stated in [E. Camby, F. Plein, Discrete Appl. Math. 217 (2017) 711-717] are either previously known or incorrect. For example, Camby and Plein claimed to provide counterexamples to the 1995 characterization of domination perfect graphs due to Zverovich and Zverovich; however, these counterexamples are not valid. Moreover, the new characterization of domination perfect graphs proposed in that paper is incorrect. For completeness, we present a relatively brief proof of the 1995 characterization of domination perfect graphs due to Zverovich and Zverovich.
Zitieren
APA
Zverovich, V. (2026). On Camby–Plein’s characterization of domination perfect graphs. Discrete Applied Mathematics, 391, 15-23. https://doi.org/10.1016/j.dam.2026.04.021
Vancouver
Zverovich V. On Camby–Plein’s characterization of domination perfect graphs. Discrete Applied Mathematics. 2026;391:15-23. doi:10.1016/j.dam.2026.04.021
BibTeX
@article{Zverovich2026,
author = {Zverovich, Vadim},
title = {On Camby–Plein’s characterization of domination perfect graphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {391},
pages = {15--23},
doi = {10.1016/j.dam.2026.04.021}
}
EUVIMED