A Complete Complexity Dichotomy of the Edge-Coloring Problem for All Sets of \(8\)-Edge Forbidden Subgraphs

D. S. Malyshev, O. I. Duginov
{"title":"A Complete Complexity Dichotomy of the Edge-Coloring Problem for All Sets of \\(8\\)-Edge Forbidden Subgraphs","authors":"D. S. Malyshev,&nbsp;O. I. Duginov","doi":"10.1134/S1990478923040099","DOIUrl":null,"url":null,"abstract":"<p> For a given graph, the edge-coloring problem is to minimize the number of colors sufficient\nto color all the graph edges so that any adjacent edges receive different colors. For all classes\ndefined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is\nknown. In this paper, we obtain a similar result for all sets of 8-edge prohibitions.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 4","pages":"791 - 801"},"PeriodicalIF":0.5800,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923040099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

For a given graph, the edge-coloring problem is to minimize the number of colors sufficient to color all the graph edges so that any adjacent edges receive different colors. For all classes defined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is known. In this paper, we obtain a similar result for all sets of 8-edge prohibitions.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
针对所有 $$8$ -Edge 禁止子图集的边缘着色问题的完全复杂性二分法
摘要 对于给定的图,边着色问题是最小化足以给所有图边着色的颜色数,从而使任何相邻的边获得不同的颜色。对于所有由禁止子图集(每个子图有 7 条边)定义的类,这个问题的复杂性状况是已知的。在本文中,我们得到了所有 8 边禁止集的类似结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Applied and Industrial Mathematics
Journal of Applied and Industrial Mathematics Engineering-Industrial and Manufacturing Engineering
CiteScore
1.00
自引率
0.00%
发文量
16
期刊介绍: Journal of Applied and Industrial Mathematics  is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.
期刊最新文献
The Structure of a Two-Layer Flow in a Channel with Radial Heating of the Lower Substrate for Small Marangoni Numbers Stability of Vertex Covers in a Game with Finitely Many Steps On Nonlocal Oscillations in 3D Models of Circular Gene Networks Cooperative Games with Preferences: Application of the Weight Rule to Problems of Public Space in St. Petersburg Ant Colony Algorithm for Single Processor Scheduling with Minimization of Peak Resource Usage
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1