Balanced list edge-colourings of bipartite graphs

https://doi.org/10.1016/j.endm.2010.05.106Get rights and content

Abstract

Galvin solved the Dinitz conjecture by proving that bipartite graphs are Δ-edge-choosable. We employ Galvin's method to show some further list edge-colouring properties of bipartite graphs. In particular, there exist balanced list edge-colourings for bipartite graphs. In the light of our result, it is a natural question whether a certain generalization of the well-known list colouring conjecture is true.

References (2)

Cited by (0)

1

Research was supported by the OTKA K 69027 and the OTKA K 60802 projects and the MTA-ELTE Egerváry Research Group.

View full text
Copyright © 2010 Elsevier B.V. All rights reserved.