图的齐次着色

IF 0.3 Q4 MATHEMATICS Mathematica Bohemica Pub Date : 2022-04-28 DOI:10.21136/mb.2022.0007-21

T. Madaras, Mária Surimová

{"title":"图的齐次着色","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 speciﬁc 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":"{\"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 speciﬁc 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}","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

摘要

如果图G的每个顶点的邻域中的色数等于l，则图G的适当顶点k-着色称为l-齐次。我们探索了一般图以及一些特定图族，特别是平面图的齐次着色的基本性质（所用颜色的存在性和数量）。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Homogeneous colourings of graphs

. 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 speciﬁc graph families, in particular planar graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematica Bohemica MATHEMATICS-

CiteScore

1.10

自引率

0.00%

发文量

审稿时长

52 weeks