List-colourings of graphs |
| |
| Authors: | B Bollobás A J Harris |
| |
| Institution: | (1) Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, CB2 1SB Cambridge, England |
| |
| Abstract: | In this paper, we go some way towards proving a conjecture of Albertson and Tucker. Among other results, we show that ifc>11/6 and Δ is sufficiently large, then a graph of maximum degree Δ with a list of cardinality cΔ] assigned to each edge may be edge-coloured so that each edge is coloured with an element of its list. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
