On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7

preprint2015arXivOpen access

Abstract

Among other results, it is shown that 3-trees are ΔΔ-edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are ΔΔ-edge-choosable.

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.