Answers are grounded in this paper and cite their sources.
In this paper, we give, for constant k, a linear time algorithm, that given a graph G = (V, E), determines whether the treewidth of G is at most k, and if so, finds a treedecomposition of G with treewidth at most k. A consequence is that every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm.
No takes yet. Share an insight, caveat, or question.
Hans L. Bodlaender (1993) studied this question.