{"title":"Note on graphs colouring","authors":"D. Marcu","doi":"10.21136/mb.1992.125898","DOIUrl":null,"url":null,"abstract":"In this paper, we give the maximal number of (k+r) -colouring of a graph with n vertices and chromatic number k . Also, we obtain the maximal values for chromatic polynomial of a graph.","PeriodicalId":107618,"journal":{"name":"Le Matematiche","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Le Matematiche","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21136/mb.1992.125898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we give the maximal number of (k+r) -colouring of a graph with n vertices and chromatic number k . Also, we obtain the maximal values for chromatic polynomial of a graph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
