I. Adler, Marshals, monotone marshals, and hypertree-width, Journal of Graph Theory, vol.58, issue.4, pp.275-296, 2004.
DOI : 10.1002/jgt.20025

G. Gottlob, N. Leone, and F. Scarcello, Hypertree decompositions and tractable queries, Journal of Computer and System Sciences, vol.209, pp.1-45, 2002.
DOI : 10.1006/jcss.2001.1809
URL : http://doi.org/10.1006/jcss.2001.1809

G. Gottlob, N. Leone, and F. Scarcello, Robbers, marshals, and guards, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.775-808, 2003.
DOI : 10.1145/375551.375579

B. Reed, Tree Width and Tangles: A New Connectivity Measure and Some Applications, Surveys in Combinatorics, pp.87-162, 1997.
DOI : 10.1017/CBO9780511662119.006

N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : http://doi.org/10.1006/jctb.1999.1919

P. D. Seymour and R. Thomas, Graph Searching and a Min-Max Theorem for Tree-Width, Journal of Combinatorial Theory, Series B, vol.58, issue.1, pp.22-33, 1993.
DOI : 10.1006/jctb.1993.1027