Title of article
Balanced list edge-colourings of bipartite graphs
Author/Authors
Fleiner، نويسنده , , Tamلs and Frank، نويسنده , , Andrلs، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
837
To page
842
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.
Keywords
Chromatic index , list edge-colouring , List , Galvinיs theorem
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455525
Link To Document