{"title":"若干派生图类的公平近适当着色","authors":"S. Jose, S. Naduvath","doi":"10.15330/cmp.14.2.529-542","DOIUrl":null,"url":null,"abstract":"An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimised by restricting the number of color classes that can have adjacency among their own elements. This paper investigates the equitable near-proper coloring of some derived graph classes like Mycielski graphs, splitting graphs and shadow graphs.","PeriodicalId":42912,"journal":{"name":"Carpathian Mathematical Publications","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On equitable near-proper coloring of some derived graph classes\",\"authors\":\"S. Jose, S. Naduvath\",\"doi\":\"10.15330/cmp.14.2.529-542\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimised by restricting the number of color classes that can have adjacency among their own elements. This paper investigates the equitable near-proper coloring of some derived graph classes like Mycielski graphs, splitting graphs and shadow graphs.\",\"PeriodicalId\":42912,\"journal\":{\"name\":\"Carpathian Mathematical Publications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Carpathian Mathematical Publications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15330/cmp.14.2.529-542\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Carpathian Mathematical Publications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15330/cmp.14.2.529-542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
On equitable near-proper coloring of some derived graph classes
An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimised by restricting the number of color classes that can have adjacency among their own elements. This paper investigates the equitable near-proper coloring of some derived graph classes like Mycielski graphs, splitting graphs and shadow graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
