On the edge coloring of graph products

M. M. M. Jaradat

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-8

Abstract:

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.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/896324.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/896324.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:896324

DOI: 10.1155/IJMMS.2005.2669

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().