{"title":"Mycielski图的重合-邻顶点可区分公平全着色","authors":"Jishun Wang, Lin Zuo, Renfu Ge, Bujun Li","doi":"10.23977/iccia2020060","DOIUrl":null,"url":null,"abstract":"The incidence-adjacent vertex distinguishing equitable total coloring of the Myceilski graphs of path, cycle, wheel and fan are discussed, and of which the incidence-adjacent vertex distinguishing equitable total chromatic numbers are confirmed efficiently by using constructive method and color adjusting technique base on the structure quality of the graphs. This method of the research provides an important reference for us to study the graph coloring problem with structural relations.","PeriodicalId":279965,"journal":{"name":"2020 4th International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2020)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Incidence-Adjacent Vertex Distinguishing Equitable Total Coloring of Mycielski Graphs\",\"authors\":\"Jishun Wang, Lin Zuo, Renfu Ge, Bujun Li\",\"doi\":\"10.23977/iccia2020060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The incidence-adjacent vertex distinguishing equitable total coloring of the Myceilski graphs of path, cycle, wheel and fan are discussed, and of which the incidence-adjacent vertex distinguishing equitable total chromatic numbers are confirmed efficiently by using constructive method and color adjusting technique base on the structure quality of the graphs. This method of the research provides an important reference for us to study the graph coloring problem with structural relations.\",\"PeriodicalId\":279965,\"journal\":{\"name\":\"2020 4th International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2020)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 4th International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2020)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23977/iccia2020060\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 4th International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2020)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23977/iccia2020060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Incidence-Adjacent Vertex Distinguishing Equitable Total Coloring of Mycielski Graphs
The incidence-adjacent vertex distinguishing equitable total coloring of the Myceilski graphs of path, cycle, wheel and fan are discussed, and of which the incidence-adjacent vertex distinguishing equitable total chromatic numbers are confirmed efficiently by using constructive method and color adjusting technique base on the structure quality of the graphs. This method of the research provides an important reference for us to study the graph coloring problem with structural relations.