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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2005-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/IJMMS.2005.2669 |
| id |
doaj-00de64b7381d4523928e5e5d2e868ae2 |
|---|---|
| record_format |
Article |
| spelling |
doaj-00de64b7381d4523928e5e5d2e868ae22020-11-25T01:03:51ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252005-01-012005162669267610.1155/IJMMS.2005.2669On the edge coloring of graph productsM. M. M. Jaradat0Jaradat: Department of Mathematics, Yarmouk University, Irbid 211-63, JordanThe 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 special product.http://dx.doi.org/10.1155/IJMMS.2005.2669 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
M. M. M. Jaradat |
| spellingShingle |
M. M. M. Jaradat On the edge coloring of graph products International Journal of Mathematics and Mathematical Sciences |
| author_facet |
M. M. M. Jaradat |
| author_sort |
M. M. M. Jaradat |
| title |
On the edge coloring of graph products |
| title_short |
On the edge coloring of graph products |
| title_full |
On the edge coloring of graph products |
| title_fullStr |
On the edge coloring of graph products |
| title_full_unstemmed |
On the edge coloring of graph products |
| title_sort |
on the edge coloring of graph products |
| publisher |
Hindawi Limited |
| series |
International Journal of Mathematics and Mathematical Sciences |
| issn |
0161-1712 1687-0425 |
| publishDate |
2005-01-01 |
| description |
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 special product. |
| url |
http://dx.doi.org/10.1155/IJMMS.2005.2669 |
| work_keys_str_mv |
AT mmmjaradat ontheedgecoloringofgraphproducts |
| _version_ |
1725199136870891520 |