图形的最大着色

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2024-08-07 DOI:10.1007/s00373-024-02823-3

Raffaella Mulas

{"title":"图形的最大着色","authors":"Raffaella Mulas","doi":"10.1007/s00373-024-02823-3","DOIUrl":null,"url":null,"abstract":"We consider two different notions of graph colouring, namely, the t-periodic colouring for vertices that has been introduced in 1974 by Bondy and Simonovits, and the periodic colouring for oriented edges that has been recently introduced in the context of spectral theory of non-backtracking operators. For each of these two colourings, we introduce the corresponding colouring number which is given by maximising the possible number of colours. We first investigate these two new colouring numbers individually, and we then show that there is a deep relationship between them.","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"5 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximal Colourings for Graphs\",\"authors\":\"Raffaella Mulas\",\"doi\":\"10.1007/s00373-024-02823-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider two different notions of graph colouring, namely, the t-periodic colouring for vertices that has been introduced in 1974 by Bondy and Simonovits, and the periodic colouring for oriented edges that has been recently introduced in the context of spectral theory of non-backtracking operators. For each of these two colourings, we introduce the corresponding colouring number which is given by maximising the possible number of colours. We first investigate these two new colouring numbers individually, and we then show that there is a deep relationship between them.\",\"PeriodicalId\":12811,\"journal\":{\"name\":\"Graphs and Combinatorics\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graphs and Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00373-024-02823-3\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02823-3","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们考虑了两种不同的图着色概念，即邦迪和西蒙诺维茨于 1974 年提出的顶点 t 周期着色，以及最近在非回溯算子谱理论中提出的面向边的周期着色。对于这两种着色，我们分别介绍了相应的着色数，它是通过最大化可能的着色数来给出的。我们首先分别研究这两种新的着色数，然后证明它们之间存在着深刻的关系。

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

Maximal Colourings for Graphs

查看原文本刊更多论文

Maximal Colourings for Graphs

We consider two different notions of graph colouring, namely, the t-periodic colouring for vertices that has been introduced in 1974 by Bondy and Simonovits, and the periodic colouring for oriented edges that has been recently introduced in the context of spectral theory of non-backtracking operators. For each of these two colourings, we introduce the corresponding colouring number which is given by maximising the possible number of colours. We first investigate these two new colouring numbers individually, and we then show that there is a deep relationship between them.

求助全文

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

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.