{"title":"所有定位色数为n-3的n阶单环图","authors":"E. Baskoro, Arfin Arfin","doi":"10.19184/ijc.2021.5.2.3","DOIUrl":null,"url":null,"abstract":"<p class=\"p1\">Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order <em>n</em> (⩾ 6) and having locating-chromatic number <em>n</em>-3.</p>","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"84 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"All unicyclic graphs of order n with locating-chromatic number n-3\",\"authors\":\"E. Baskoro, Arfin Arfin\",\"doi\":\"10.19184/ijc.2021.5.2.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p class=\\\"p1\\\">Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order <em>n</em> (⩾ 6) and having locating-chromatic number <em>n</em>-3.</p>\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"84 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/ijc.2021.5.2.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/ijc.2021.5.2.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
All unicyclic graphs of order n with locating-chromatic number n-3
Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (⩾ 6) and having locating-chromatic number n-3.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
