International Journal of Mathematics and Mathematical Sciences 
Volume 2003 (2003), Issue 46, Pages 2947-2959
doi:10.1155/S0161171203211492

On resolving edge colorings in graphs

Varaporn Saenpholphat1 and Ping Zhang2

 1Mathematics Department, Srinakharinwirot University, Sukhumvit 23, Bangkok 10110, Thailand
2Department of Mathematics, Western Michigan University, Kalamazoo 49008, MI, USA
Received 26 November 2002

Abstract

We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving edge chromatic number of a connected graph.