List Colouring When The Chromatic Number Is Close To the Order Of The Graph
List Colouring When The Chromatic Number Is Close To the Order Of The Graph
复制标题
DOI：
10.1007/s00493-005-0010-x
复制
发表时间：
2004-12
期刊：
影响因子：
1.1
通讯作者：
B. Reed;B. Sudakov
中科院分区：
文献类型：
--
作者：
B. Reed;B. Sudakov
列表着色的一个实例由图G和G的每个顶点v的颜色列表L (v)组成。我们被要求确定G是否有一个可接受的着色，即每个顶点从其列表中接收到一种颜色，并且没有任何一条边的两个端点都有相同的颜色。
An instance of List Colouring consists of a graph G and a list L (v) of colours for each vertex v of G. We are asked to determine if there is an acceptable colouring of G, that is a colouring in which each vertex receives a colour from its list, and no edge has both its endpoints coloured with the same colour.