Article ID Journal Published Year Pages File Type
4646617 Discrete Mathematics 2016 8 Pages PDF
Abstract
The main technique used to edge-colour graphs requiring Δ+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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On a limit of the method of Tashkinov trees for edge-colouring
Authors
, ,