@inproceedings{b20bbe1496cb4b62bf34424a67ee1a38,
title = "Polynomial algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees",
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). Also, we show that there exist algorithms that find tree-decompositions with treewidth ≤k of graphs with treewidth ≤k, in O(n^3) time, (k constant).",
author = "Hans Bodlaender",
year = "1988",
doi = "10.1007/3-540-19487-8_26",
language = "English",
isbn = "978-3-540-19487-3",
volume = "318",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "223",
editor = "Rolf Karlsson and Andrzej Lingas",
booktitle = "1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings",
address = "Germany",
note = "1st Scandinavian Workshop on Algorithm Theory, SWAT 1988 ; Conference date: 05-07-1988 Through 08-07-1988",
}