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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.