Abstract
AbstractWe prove that the list chromatic index of a graph of maximum degree Δ and treewidth is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth is . This improves results by Meeks and Scott.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have