Paper Info
Title
Balanced list edge-colourings of bipartite graphs
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.
Year
DOI
Venue
2010
10.1016/j.endm.2010.05.106
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
list edge-colouring,galvin's theorem,list,chromatic index,bipartite graph,indexation
Edge coloring,Discrete mathematics,Complete bipartite graph,Combinatorics,Stable marriage problem,Biregular graph,Bipartite graph,Matching (graph theory),3-dimensional matching,Mathematics,Dinitz conjecture
Journal
Volume
ISSN
Citations 
36
Electronic Notes in Discrete Mathematics
0
PageRank 
References 
Authors
0.34
2
2
Name
Order
Citations
PageRank
Tamás Fleiner124127.45
András Frank2753163.71