科研之友
微信
新浪微博
Facebook
分享链接
摘要
<正>Upper Bounds on List Star Chromatic Index of Sparse Graphs Jia Ao LI Katie HORACEK Rong LUO Zheng Ke MI AO Abstract A star k-edge-coloring is a proper k-edge-coloring such that every connected bicolored subgraph is a path of length at most 3.The star chromatic index X′st(G) of a graph G is the smallest integer k such that G has a star k-edge-coloring.The list star chromatic index ch′st(G) is defined analogously.The star edge coloring problem is known to be NP-complete,and
