On Camby-Plein's Characterization of Domination Perfect Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912901881659392 |
|---|---|
| author | Zverovich, Vadim |
| author_facet | Zverovich, Vadim |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_12374 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Camby-Plein's Characterization of Domination Perfect Graphs Zverovich, Vadim Combinatorics 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. |
| title | On Camby-Plein's Characterization of Domination Perfect Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2602.12374 |