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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
