On a limit of the method of Tashkinov trees for edge-colouring
classification
🧮 math.CO
keywords
methodtashkinovlimittreeschangescoloursdeltaedge-colour
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.