On the edge coloring of graph products
The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. We will determine a sufficient condition for a various graph products to be of class 1, namely, strong product, semistrong product, and specia...
Збережено в:
| Автор: | |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Wiley
2005-01-01
|
| Серія: | International Journal of Mathematics and Mathematical Sciences |
| Онлайн доступ: | http://dx.doi.org/10.1155/IJMMS.2005.2669 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|