On a limit of the method of Tashkinov trees for edge-colouring

preprint2016arXivOpen access

Abstract

The main technique used to edge-colour graphs requiring Δ+2Δ+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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.