List edge colourings of some 1-factorable multigraphs |
| |
| Authors: | M N Ellingham Luis Goddyn |
| |
| Institution: | (1) Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, 37240 Nashville, TN, U. S. A.;(2) Department of Mathematics and Statistics, Simon Fraser University, V5A 1S6 Burnaby, BC, Canada |
| |
| Abstract: | The List Edge Colouring Conjecture asserts that, given any multigraphG with chromatic indexk and any set system {S
e
:e E(G)} with each |S
e
|=k, we can choose elementss
e
S
e
such thats
e
 s
f
whenevere andf are adjacent edges. Using a technique of Alon and Tarsi which involves the graph monomial
of an oriented graph, we verify this conjecture for certain families of 1-factorable multigraphs, including 1-factorable planar graphs.Supported by the University Research Council of Vanderbilt University and NSERC Canada grants A5414 and A5499.Supported by NSERC Canada grant A5499 |
| |
| Keywords: | 05C15 (05C70 05C10) |
| 本文献已被 SpringerLink 等数据库收录！ |
|
