首页|List star edge-coloring of claw-free subcubic multigraphs
List star edge-coloring of claw-free subcubic multigraphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
? 2021 Elsevier B.V.A star edge-coloring of a multigraph G is a proper edge-coloring of G such that no path or cycle of length four is bi-colored. The star chromatic index of G is the minimum number of colors needed to guarantee that G admits a star edge-coloring. The list star chromatic index of G is the smallest integer k such that for any k-uniform list assignment L for the set of edges, G has a star edge-coloring from L. Dvo?ák, Mohar and ?ámal proved that every subcubic multigraph has star chromatic index at most 7, and conjectured that 7 can be further improved to 6. Lu?ar, Mockov?iaková and Soták strengthened the result of Dvo?ák, Mohar and ?ámal by showing that every subcubic multigraph has list star chromatic index at most 7. In this paper, we verify the conjecture of Dvo?ák, Mohar and ?ámal for a class of subcubic multigraphs. We prove that every claw-free subcubic multigraph has list star chromatic index at most 6, and give a few examples to show that the upper bound is tight.
Claw-freeList star chromatic indexStar chromatic indexStar edge-coloringSubcubic multigraph
Cui Q.、Han Z.
展开 >
Department of Mathematics Nanjing University of Aeronautics and Astronautics
NSTL
Elsevier
