Editing Tree decomposition (section)

==References==
{{refbegin|colwidth=30em}}
*{{citation
 | last1 = Arnborg | first1 = S.
 | last2 = Corneil | first2 = D. | author2-link = Derek Corneil
 | last3 = Proskurowski | first3 = A.
 | title = Complexity of finding embeddings in a ''k''-tree
 | journal = SIAM Journal on Matrix Analysis and Applications
 | volume = 8 | issue = 2 | year = 1987 | pages = 277–284 | doi = 10.1137/0608024}}. 
*{{citation
 | last1 = Arnborg | first1 = S.
 | last2 = Proskurowski | first2 = A.
 | title = Linear time algorithms for NP-hard problems restricted to partial ''k''-trees
 | journal = Discrete Applied Mathematics
 | volume = 23 | issue = 1 | year = 1989 | pages = 11–24 | doi = 10.1016/0166-218X(89)90031-0| doi-access = free }}.
*{{citation
 | last1 = Bern | first1 = M. W.
 | last2 = Lawler | first2 = E. L. | author2-link = Eugene Lawler
 | last3 = Wong | first3 = A. L.
 | title = Linear-time computation of optimal subgraphs of decomposable graphs
 | journal = Journal of Algorithms
 | volume = 8 | issue = 2 | year = 1987 | pages = 216–235 | doi = 10.1016/0196-6774(87)90039-3}}.
*{{citation
 | last1 = Bertelé | first1 = Umberto
 | last2 = Brioschi | first2 = Francesco
 | title = Nonserial Dynamic Programming
 | year = 1972
 | publisher = Academic Press
 | isbn = 0-12-093450-7}}.
*{{citation
 | last = Bodlaender | first = Hans L. | authorlink = Hans L. Bodlaender
 | contribution = Dynamic programming on graphs with bounded treewidth
 | title = Proc. 15th International Colloquium on Automata, Languages and Programming
 | publisher = Springer-Verlag
 | series = Lecture Notes in Computer Science
 | volume = 317 | year = 1988 | pages = 105–118
 | doi = 10.1007/3-540-19488-6_110| hdl = 1874/16258 | isbn = 978-3-540-19488-0 | hdl-access = free}}.
*{{citation
 | last = Bodlaender | first = Hans L. | authorlink = Hans L. Bodlaender
 | title = A linear time algorithm for finding tree-decompositions of small treewidth
 | journal = SIAM Journal on Computing
 | volume = 25 | issue = 6 | year = 1996 | pages = 1305–1317 | doi = 10.1137/S0097539793251219| citeseerx = 10.1.1.113.4539 }}.
*{{Citation
| last=Diestel | first=Reinhard
| title=Graph Theory
| publisher=[[Springer Science+Business Media|Springer]]
| year=2005
| edition=3rd
| isbn=3-540-26182-6
| url=http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/
}}.
*{{citation
 | last1 = Gottlob | first1 = Georg
 | last2 = Lee | first2 = Stephanie Tien
 | last3 = Valiant | first3 = Gregory
 | last4 = Valiant | first4 = Paul
 | doi = 10.1145/2220357.2220363
 | issue = 3
 | journal = [[Journal of the ACM]]
 | mr = 2946220
 | page = A16:1–A16:35
 | title = Size and treewidth bounds for conjunctive queries
 | volume = 59
 | year = 2012}}
*{{Citation
 | title = ''S''-functions for graphs
 | year = 1976
 | last = Halin | first = Rudolf | authorlink = Rudolf Halin
 | journal = Journal of Geometry
 | pages = 171–186
 | volume = 8
 | issue = 1–2
 | doi=10.1007/BF01917434
| s2cid = 120256194
 }}.
*{{citation
 | last1 = Robertson | first1 = Neil | authorlink1 = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul D. | authorlink2 = Paul Seymour (mathematician)
 | title = Graph minors III: Planar tree-width
 | journal = [[Journal of Combinatorial Theory]] | series=Series B
 | volume = 36
 | issue = 1 | year = 1984 | pages = 49–64
 | doi = 10.1016/0095-8956(84)90013-3| doi-access = free}}.
{{refend}}

[[Category:Trees (graph theory)]]
[[Category:Graph minor theory]]
[[Category:Graph theory objects]]