{"title":"Resolving Edge Colorings in Graphs","authors":"G. Chartrand, Varaporn Saenpholphat, Ping Zhang","doi":"10.1155/S0161171203211492","DOIUrl":null,"url":null,"abstract":"We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving \nedge chromatic number of a connected graph.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Comb.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/S0161171203211492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
