Edge colouring multigraphs
|
Tue, 10/05/2011 14:30 |
Penny Haxell (Waterloo) |
Combinatorial Theory Seminar  |
L3 |
| We highlight a technique for studying edge colourings of multigraphs, due to Tashkinov. This method is a sophisticated generalisation of the method of alternating paths, and builds upon earlier work by Kierstead and Goldberg. In particular we show how to apply it to a number of edge colouring problems, including the question of whether the class of multigraphs that attain equality in Vizing's classical bound can be characterised. This talk represents joint work with Jessica McDonald. | |||