Abstract
In this paper we show that graph isomorphism and chromatic index are solvable in polynomial time when restricted to the class of graphs with treewidth ≤ k ( k a constant) (or equivalently, the class of partial k-trees).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have