Edge-choosability in line-perfect multigraphs
暂无分享,去创建一个
Abstract A multigraph is line-perfect if its line graph is perfect. We prove 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 leads to several characterizations of line-perfect multigraphs in terms of edge-choosability properties. It also proves that these multigraphs satisfy the list - coloring conjecture , which states that if every edge of G is given a list of χ ′( G ) colors (where χ ′ denotes the chromatic index) then G can be edge-colored from its lists. Since bipartite multigraphs are line-perfect, this generalizes Galvin's result that the conjecture holds for bipartite multigraphs.
[1] N. Alon. Restricted colorings of graphs , 1993 .
[2] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[3] Frédéric Maffray,et al. Kernels in perfect line-graphs , 1992, J. Comb. Theory, Ser. B.
[4] Alexandr V. Kostochka,et al. List Edge and List Total Colourings of Multigraphs , 1997, J. Comb. Theory B.
[5] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.