Publication:
On resolving edge colorings in graphs

0
0

Issued Date

2003

Resource Type

Article

File Type

application/pdf

ISSN

1611712

DOI

10.1155/S0161171203211492

Other identifier(s)

2-s2.0-17844369408

Rights Holder(s)

มหาวิทยาลัยศรีนครินทรวิโรฒ

Bibliographic Citation

International Journal of Mathematics and Mathematical Sciences. Vol 2003, No.46 (2003), p.2947-2959

Suggested Citation

Saenpholphat V., Zhang P. On resolving edge colorings in graphs. International Journal of Mathematics and Mathematical Sciences. Vol 2003, No.46 (2003), p.2947-2959. doi:10.1155/S0161171203211492 Retrieved from: https://hdl.handle.net/20.500.14740/6607

Title

On resolving edge colorings in graphs

Author(s)

Saenpholphat V.
 Zhang P.

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.

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/6607

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By