Sciweavers

ENDM
2010
100views more  ENDM 2010»
13 years 3 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 bipa...
Tamás Fleiner, András Frank