Publication:
On resolving edge colorings in graphs

dc.contributor.authorSaenpholphat V.
dc.contributor.authorZhang P.
dc.date.accessioned2021-04-05T04:32:56Z
dc.date.available2021-04-05T04:32:56Z
dc.date.issued2003
dc.date.issuedBE2546
dc.description.abstractWe 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.
dc.format.mimetypeapplication/pdf
dc.identifier.citationInternational Journal of Mathematics and Mathematical Sciences. Vol 2003, No.46 (2003), p.2947-2959
dc.identifier.doi10.1155/S0161171203211492
dc.identifier.issn1611712
dc.identifier.other2-s2.0-17844369408
dc.identifier.urihttps://hdl.handle.net/20.500.14740/6607
dc.rights.holderมหาวิทยาลัยศรีนครินทรวิโรฒ
dc.titleOn resolving edge colorings in graphs
dc.typeArticle
dspace.entity.typePublication
swu.datasource.scopushttps://www.scopus.com/inward/record.uri?eid=2-s2.0-17844369408&doi=10.1155%2fS0161171203211492&partnerID=40&md5=7d9202957ed743e23aba932f52f54249

Files