PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.) Vol. 36(50), pp. 1316 (1984) 

ON EDGECOLORABILITY OF PRODUCTS OF GRAPHSBojan MoharDepartment of Mathematics, E. Kardelj University, Ljubljana, SloveniaAbstract: Let $\chi'(G)$ denote the edgechromatic number and $\Delta(G)$ the maximum vertex degree of a graph $G$. A graph $G$ is said to be {\it of class} 1 if $\chi'(G)=\Delta(G)$ and {\it of class} 2 otherwise. Some sufficient conditions for various graph products (the Cartesian, lexicographic, tensor and strong product) to be of class 1 are given. Keywords: Edgecoloring, Graph products Classification (MSC2000): 05C15, 05C70 Full text of the article:
Electronic fulltext finalized on: 3 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
