Author:
HÄGGKVIST ROLAND,JANSSEN JEANNETTE
Abstract
In this paper we show that the list chromatic index of the complete
graph Kn is at most n.
This proves the list-chromatic conjecture for complete graphs of odd order.
We also prove
the asymptotic result that for a simple graph with maximum degree d
the list chromatic index exceeds d by at most
[Oscr ](d2/3√log d).
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献