A Complete Complexity Dichotomy of the Edge-Coloring Problem for All Sets of \(8\)-Edge Forbidden Subgraphs
IF 0.58
Q3 Engineering
引用次数: 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.
针对所有 $$8$ -Edge 禁止子图集的边缘着色问题的完全复杂性二分法
摘要 对于给定的图，边着色问题是最小化足以给所有图边着色的颜色数，从而使任何相邻的边获得不同的颜色。对于所有由禁止子图集（每个子图有 7 条边）定义的类，这个问题的复杂性状况是已知的。在本文中，我们得到了所有 8 边禁止集的类似结果。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文
求助全文
来源期刊
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
