Title of article
Erratum to “Edge-choosability in line-perfect multigraphs” [Discrete Mathematics 202 (1999) 191]
Author/Authors
Dale Peterson، نويسنده , , Douglas R. Woodall، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
4
From page
323
To page
326
Abstract
A multigraph is line perfect if its line graph is perfect. In (Discrete Math. 202 (1999) 191) we claimed that if every edge e of a line-perfect multigraph G is given a list containing at least as many colors as there are edges in a largest edge-clique containing e, then G can be edge-colored from its lists. This note corrects a mistake in our proof.
Keywords
Edge choosability , Perfect graph , Edge coloring , List chromatic index , List-coloring conjecture , Perfect line graph , Line-perfect multigraph , Chromatic index
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949461
Link To Document