稀疏图的列表单射边染色

List Injective Edge Coloring of Sparse Graphs

图G的单射边染色是对图G的边进行染色,使得如果三条边e1,e2,e3是连续的,那么e1和e3染不同的颜色。图G的单射边色数是所有单射边染色中所用颜色最少的颜色数。在本文中,我们考虑单射边染色的列表版本,得到在最大平均度条件限制下稀疏图的列表单射边色数的上界。

An injective edge coloring of a graph G is a coloring of the edges of G, such that if three edges e1, e2, and e3 are consecutive, then e1 and e3 are colored differently. The injective edge coloring number is the smallest number of colors used in all injective edge colorings of G. In this paper, we consider the list injective edge coloring of graphs, and obtain some upper bounds of the list injective edge coloring number of sparse graphs in terms of the maximum average degree of G.