Skip to main content
Journal ArticleOPEN ACCESS

On resolving edge colorings in graphs

International Journal of Mathematics and Mathematical Sciences (2003) 2003(46) 2947-2959
DOI: 10.1155/S0161171203211492
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 2003 Hindawi Publishing Corporation. All rights reserved.

Cite

CITATION STYLE

APA

Saenpholphat, V., & Zhang, P. (2003). On resolving edge colorings in graphs. International Journal of Mathematics and Mathematical Sciences, 2003(46), 2947–2959. https://doi.org/10.1155/S0161171203211492

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free