Indexed metadata
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
ROLAND HÄGGKVIST, JEANNETTE JANSSEN
Source record
Source: Crossref
Published: Sep 1, 1997
DOI: 10.1017/s0963548397002927
Open original source ↗Source abstract
In this paper we show that the list chromatic index of the complete graph K n 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 ]( d 2/3 √log d ).
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.