Star edge-coloring of graphs with maximum degree four
作者:
Highlights:
•
摘要
The star chromatic index χst′(G) of a graph G is the smallest integer k for which G has a proper k-edge-coloring without bichromatic paths or cycles of length four. In this paper, we prove that (1) if G is a graph with Δ=4, then χst′(G)≤14; and (2) if G is a bipartite graph with Δ=4, then χst′(G)≤13.
论文关键词:Star edge-coloring,Star chromatic index,Maximum degree,Edge-partition
论文评审过程:Received 19 June 2018, Revised 16 August 2018, Accepted 20 August 2018, Available online 11 September 2018, Version of Record 11 September 2018.
论文官网地址:https://doi.org/10.1016/j.amc.2018.08.035