Equitable Colorings Of Corona Multiproducts Of Graphs
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G). It is kn...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
University of Zielona Góra
2017-11-01
|
| Серія: | Discussiones Mathematicae Graph Theory |
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.7151/dmgt.1992 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|