周长为 9 且没有较长奇数孔的图形是 3 可取的

Pub Date : 2024-04-11 DOI:10.1002/jgt.23101

Yan Wang, Rong Wu

{"title":"周长为 9 且没有较长奇数孔的图形是 3 可取的","authors":"Yan Wang, Rong Wu","doi":"10.1002/jgt.23101","DOIUrl":null,"url":null,"abstract":"For a number <math>\n \n <mrow>\n <mi>l</mi>\n \n <mo>≥</mo>\n \n <mn>2</mn>\n </mrow></math>, let <math>\n \n <mrow>\n <msub>\n <mi>G</mi>\n \n <mi>l</mi>\n </msub>\n </mrow></math> denote the family of graphs which have girth <math>\n \n <mrow>\n <mn>2</mn>\n \n <mi>l</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow></math> and have no odd hole with length greater than <math>\n \n <mrow>\n <mn>2</mn>\n \n <mi>l</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow></math>. Wu, Xu and Xu conjectured that every graph in <math>\n \n <mrow>\n <msub>\n <mo>⋃</mo>\n \n <mrow>\n <mi>l</mi>\n \n <mo>≥</mo>\n \n <mn>2</mn>\n </mrow>\n </msub>\n \n <msub>\n <mi>G</mi>\n \n <mi>l</mi>\n </msub>\n </mrow></math> is 3-colourable. Chudnovsky et al., Wu et al., and Chen showed that every graph in <math>\n \n <mrow>\n <msub>\n <mi>G</mi>\n \n <mn>2</mn>\n </msub>\n </mrow></math>, <math>\n \n <mrow>\n <msub>\n <mi>G</mi>\n \n <mn>3</mn>\n </msub>\n </mrow></math> and <math>\n \n <mrow>\n <msub>\n <mo>⋃</mo>\n \n <mrow>\n <mi>l</mi>\n \n <mo>≥</mo>\n \n <mn>5</mn>\n </mrow>\n </msub>\n \n <msub>\n <mi>G</mi>\n \n <mi>l</mi>\n </msub>\n </mrow></math> is 3-colourable, respectively. In this paper, we prove that every graph in <math>\n \n <mrow>\n <msub>\n <mi>G</mi>\n \n <mn>4</mn>\n </msub>\n </mrow></math> is 3-colourable. This confirms Wu, Xu and Xu's conjecture.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graphs with girth 9 and without longer odd holes are 3-colourable\",\"authors\":\"Yan Wang, Rong Wu\",\"doi\":\"10.1002/jgt.23101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a number <math>\\n \\n <mrow>\\n <mi>l</mi>\\n \\n <mo>≥</mo>\\n \\n <mn>2</mn>\\n </mrow></math>, let <math>\\n \\n <mrow>\\n <msub>\\n <mi>G</mi>\\n \\n <mi>l</mi>\\n </msub>\\n </mrow></math> denote the family of graphs which have girth <math>\\n \\n <mrow>\\n <mn>2</mn>\\n \\n <mi>l</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n </mrow></math> and have no odd hole with length greater than <math>\\n \\n <mrow>\\n <mn>2</mn>\\n \\n <mi>l</mi>\\n \\n <mo>+</mo>\\n \\n <mn>1</mn>\\n </mrow></math>. Wu, Xu and Xu conjectured that every graph in <math>\\n \\n <mrow>\\n <msub>\\n <mo>⋃</mo>\\n \\n <mrow>\\n <mi>l</mi>\\n \\n <mo>≥</mo>\\n \\n <mn>2</mn>\\n </mrow>\\n </msub>\\n \\n <msub>\\n <mi>G</mi>\\n \\n <mi>l</mi>\\n </msub>\\n </mrow></math> is 3-colourable. Chudnovsky et al., Wu et al., and Chen showed that every graph in <math>\\n \\n <mrow>\\n <msub>\\n <mi>G</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow></math>, <math>\\n \\n <mrow>\\n <msub>\\n <mi>G</mi>\\n \\n <mn>3</mn>\\n </msub>\\n </mrow></math> and <math>\\n \\n <mrow>\\n <msub>\\n <mo>⋃</mo>\\n \\n <mrow>\\n <mi>l</mi>\\n \\n <mo>≥</mo>\\n \\n <mn>5</mn>\\n </mrow>\\n </msub>\\n \\n <msub>\\n <mi>G</mi>\\n \\n <mi>l</mi>\\n </msub>\\n </mrow></math> is 3-colourable, respectively. In this paper, we prove that every graph in <math>\\n \\n <mrow>\\n <msub>\\n <mi>G</mi>\\n \\n <mn>4</mn>\\n </msub>\\n </mrow></math> is 3-colourable. This confirms Wu, Xu and Xu's conjecture.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于一个数，让表示有周长且没有长度大于的奇数洞的图族。吴、徐和徐猜想，在的每一个图都是 3 可容的。Chudnovsky 等人、Wu 等人和 Chen 分别证明了、和中的每个图都是 3 可容的。在本文中，我们证明了每个 in 的图都是 3 有利的。这证实了 Wu、Xu 和 Xu 的猜想。

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

查看原文

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

Graphs with girth 9 and without longer odd holes are 3-colourable

For a number $l \geq 2$ , let $G_{l}$ denote the family of graphs which have girth $2 l + 1$ and have no odd hole with length greater than $2 l + 1$ . Wu, Xu and Xu conjectured that every graph in $⋃_{l \geq 2} G_{l}$ is 3-colourable. Chudnovsky et al., Wu et al., and Chen showed that every graph in $G_{2}$ , $G_{3}$ and $⋃_{l \geq 5} G_{l}$ is 3-colourable, respectively. In this paper, we prove that every graph in $G_{4}$ is 3-colourable. This confirms Wu, Xu and Xu's conjecture.

求助全文

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