Defective Coloring on Classes of Perfect Graphs
In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$. We show that this natural generalization of Coloring is much harder on several basic graph clas...
| Main Authors: | , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Discrete Mathematics & Theoretical Computer Science
2022-01-01
|
| 丛编: | Discrete Mathematics & Theoretical Computer Science |
| 主题: | |
| 在线阅读: | https://dmtcs.episciences.org/4926/pdf |