Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/15194
ชื่อเรื่อง: On resolving edge colorings in graphs
ผู้แต่ง: Saenpholphat V.
Zhang P.
วันที่เผยแพร่: 2003
บทคัดย่อ: 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.
URI: https://ir.swu.ac.th/jspui/handle/123456789/15194
https://www.scopus.com/inward/record.uri?eid=2-s2.0-17844369408&doi=10.1155%2fS0161171203211492&partnerID=40&md5=7d9202957ed743e23aba932f52f54249
ISSN: 1611712
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.