Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/15194
Full metadata record
DC FieldValueLanguage
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.identifier.issn1611712
dc.identifier.other2-s2.0-17844369408
dc.identifier.urihttps://ir.swu.ac.th/jspui/handle/123456789/15194-
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-17844369408&doi=10.1155%2fS0161171203211492&partnerID=40&md5=7d9202957ed743e23aba932f52f54249
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.titleOn resolving edge colorings in graphs
dc.typeArticle
dc.rights.holderScopus
dc.identifier.bibliograpycitationInternational Journal of Mathematics and Mathematical Sciences. Vol 2003, No.46 (2003), p.2947-2959
dc.identifier.doi10.1155/S0161171203211492
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.