On a limit of the method of Tashkinov trees for edge-colouring
  The main technique used to edge-colour graphs requiring $\Delta+2$ or more colours is the method of Tashkinov trees. We present a specific limit to this method, in terms of Kempe changes. We also provide a new Tashkinov tree extension. 
John Asplund, Jessica McDonald
math.CO