{"title":"Homogeneous colourings of graphs","authors":"T. Madaras, Mária Surimová","doi":"10.21136/mb.2022.0007-21","DOIUrl":null,"url":null,"abstract":". A proper vertex k -colouring of a graph G is called l -homogeneous if the number of colours in the neigbourhood of each vertex of G equals l . We explore basic properties (the existence and the number of used colours) of homogeneous colourings of graphs in general as well as of some specific graph families, in particular planar graphs.","PeriodicalId":45392,"journal":{"name":"Mathematica Bohemica","volume":" ","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematica Bohemica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21136/mb.2022.0007-21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
. A proper vertex k -colouring of a graph G is called l -homogeneous if the number of colours in the neigbourhood of each vertex of G equals l . We explore basic properties (the existence and the number of used colours) of homogeneous colourings of graphs in general as well as of some specific graph families, in particular planar graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
