EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 36(50), pp. 13--16 (1984)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

ON EDGE-COLORABILITY OF PRODUCTS OF GRAPHS

Bojan Mohar

Department of Mathematics, E. Kardelj University, Ljubljana, Slovenia

Abstract: Let $\chi'(G)$ denote the edge-chromatic 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: Edge-coloring, 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
© 2001 ELibM for the EMIS Electronic Edition