Sciweavers

Share
ENDM
2010

Balanced list edge-colourings of bipartite graphs

8 years 7 months ago
Balanced list edge-colourings of bipartite graphs
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring 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.
Tamás Fleiner, András Frank
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where ENDM
Authors Tamás Fleiner, András Frank
Comments (0)
books