无 4 循环的 1 平面图的无循环边着色

IF 0.9 4区 数学 Q3 MATHEMATICS, APPLIED
Wei-fan Wang, Yi-qiao Wang, Wan-shun Yang
{"title":"无 4 循环的 1 平面图的无循环边着色","authors":"Wei-fan Wang,&nbsp;Yi-qiao Wang,&nbsp;Wan-shun Yang","doi":"10.1007/s10255-024-1101-z","DOIUrl":null,"url":null,"abstract":"<div><p>An acyclic edge coloring of a graph <i>G</i> is a proper edge coloring such that there are no bichromatic cycles in <i>G</i>. The acyclic chromatic index <span>\\(\\cal{X}_{\\alpha}^{\\prime}(G)\\)</span> of <i>G</i> is the smallest <i>k</i> such that <i>G</i> has an acyclic edge coloring using <i>k</i> colors. It was conjectured that every simple graph <i>G</i> with maximum degree Δ has <span>\\(\\cal{X}_{\\alpha}^{\\prime}(G)\\le\\Delta+2\\)</span>. A 1-planar graph is a graph that can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, we show that every 1-planar graph <i>G</i> without 4-cycles has <span>\\(\\cal{X}_{\\alpha}^{\\prime}(G)\\le\\Delta+22\\)</span>.</p></div>","PeriodicalId":6951,"journal":{"name":"Acta Mathematicae Applicatae Sinica, English Series","volume":"40 1","pages":"35 - 44"},"PeriodicalIF":0.9000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Acyclic Edge Coloring of 1-planar Graphs without 4-cycles\",\"authors\":\"Wei-fan Wang,&nbsp;Yi-qiao Wang,&nbsp;Wan-shun Yang\",\"doi\":\"10.1007/s10255-024-1101-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>An acyclic edge coloring of a graph <i>G</i> is a proper edge coloring such that there are no bichromatic cycles in <i>G</i>. The acyclic chromatic index <span>\\\\(\\\\cal{X}_{\\\\alpha}^{\\\\prime}(G)\\\\)</span> of <i>G</i> is the smallest <i>k</i> such that <i>G</i> has an acyclic edge coloring using <i>k</i> colors. It was conjectured that every simple graph <i>G</i> with maximum degree Δ has <span>\\\\(\\\\cal{X}_{\\\\alpha}^{\\\\prime}(G)\\\\le\\\\Delta+2\\\\)</span>. A 1-planar graph is a graph that can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, we show that every 1-planar graph <i>G</i> without 4-cycles has <span>\\\\(\\\\cal{X}_{\\\\alpha}^{\\\\prime}(G)\\\\le\\\\Delta+22\\\\)</span>.</p></div>\",\"PeriodicalId\":6951,\"journal\":{\"name\":\"Acta Mathematicae Applicatae Sinica, English Series\",\"volume\":\"40 1\",\"pages\":\"35 - 44\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-01-03\",\"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-1101-z\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematicae Applicatae Sinica, English Series","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10255-024-1101-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

摘要 图 G 的非循环边着色是指 G 中不存在双色循环的适当边着色。G 的非循环色度指数 \(\cal{X}_{\alpha}^{\prime}(G)\)是使 G 具有使用 k 种颜色的非循环边着色的最小 k。有人猜想,每个具有最大度 Δ 的简单图 G 都有\(\cal{X}_{alpha}^{\prime}(G)\le\Delta+2\)。1-planar graph(1-平面图)是指可以在平面上绘制的图,每条边最多与另一条边交叉。在本文中,我们证明了每一个没有 4 循环的 1-planar graph G 都有\(\cal{X}_{\alpha}^{\prime}(G)\le\Delta+22\) .
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Acyclic Edge Coloring of 1-planar Graphs without 4-cycles

An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles in G. The acyclic chromatic index \(\cal{X}_{\alpha}^{\prime}(G)\) of G is the smallest k such that G has an acyclic edge coloring using k colors. It was conjectured that every simple graph G with maximum degree Δ has \(\cal{X}_{\alpha}^{\prime}(G)\le\Delta+2\). A 1-planar graph is a graph that can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, we show that every 1-planar graph G without 4-cycles has \(\cal{X}_{\alpha}^{\prime}(G)\le\Delta+22\).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信