The Chromatic Number of (P5, HVN)-free Graphs

IF 0.9 4区 数学 Q3 MATHEMATICS, APPLIED
Yian Xu
{"title":"The Chromatic Number of (P5, HVN)-free Graphs","authors":"Yian Xu","doi":"10.1007/s10255-024-1029-3","DOIUrl":null,"url":null,"abstract":"<div><p>Let <i>G</i> be a graph. We use <i>χ</i>(<i>G</i>) and <i>ω</i>(<i>G</i>) to denote the chromatic number and clique number of <i>G</i> respectively. A <i>P</i><sub>5</sub> is a path on 5 vertices, and an HVN is a <i>K</i><sub>4</sub> together with one more vertex which is adjacent to exactly two vertices of <i>K</i><sub>4</sub>. Combining with some known result, in this paper we show that if <i>G</i> is (<i>P</i><sub>5</sub>, <i>HVN</i>)-free, then <i>χ</i>(<i>G</i>) ≤ max{min{16, <i>ω</i>(<i>G</i>) + 3}, <i>ω</i>(<i>G</i>) + 1}. This upper bound is almost sharp.</p></div>","PeriodicalId":6951,"journal":{"name":"Acta Mathematicae Applicatae Sinica, English Series","volume":"40 4","pages":"1098 - 1110"},"PeriodicalIF":0.9000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematicae Applicatae Sinica, English Series","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10255-024-1029-3","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Let G be a graph. We use χ(G) and ω(G) to denote the chromatic number and clique number of G respectively. A P5 is a path on 5 vertices, and an HVN is a K4 together with one more vertex which is adjacent to exactly two vertices of K4. Combining with some known result, in this paper we show that if G is (P5, HVN)-free, then χ(G) ≤ max{min{16, ω(G) + 3}, ω(G) + 1}. This upper bound is almost sharp.

无 (P5, HVN) 图形的色度数
设 G 是一个图。我们用 χ(G) 和 ω(G) 分别表示 G 的色度数和簇数。一个 P5 是 5 个顶点上的一条路径,而一个 HVN 是一个 K4 加上另外一个顶点,该顶点正好与 K4 的两个顶点相邻。结合一些已知结果,本文证明了如果 G 是(P5, HVN)无顶点的,那么 χ(G) ≤ max{min{16, ω(G) + 3}, ω(G) + 1}。这个上限几乎是尖锐的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.30
自引率
0.00%
发文量
70
审稿时长
3.0 months
期刊介绍: Acta Mathematicae Applicatae Sinica (English Series) is a quarterly journal established by the Chinese Mathematical Society. The journal publishes high quality research papers from all branches of applied mathematics, and particularly welcomes those from partial differential equations, computational mathematics, applied probability, mathematical finance, statistics, dynamical systems, optimization and management science.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信