H. L. Bodlaender and D. M. Thilikos, Constructive linear time algorithms for branchwidth, 24th International Colloquium on Automata, Languages, and Programming (ICALP), pp.627-637, 1997.
DOI : 10.1007/3-540-63165-8_217

H. L. Bodlaender and D. M. Thilikos, Graphs with Branchwidth at Most Three, Journal of Algorithms, vol.32, issue.2, pp.167-194, 1999.
DOI : 10.1006/jagm.1999.1011

K. Booth and G. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

W. Cook and P. D. Seymour, Tour Merging via Branch-Decomposition, INFORMS Journal on Computing, vol.15, issue.3, pp.233-248, 2003.
DOI : 10.1287/ijoc.15.3.233.16078

E. Demaine, F. Fomin, M. Hajiaghayi, and D. M. Thilikos, Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs, 30th International Colloquium on Automata, Languages, and Programming (ICALP), pp.829-844, 2003.
DOI : 10.1007/3-540-45061-0_65

F. Fomin and D. Thilikos, Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up, 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.168-177, 2003.
DOI : 10.1137/S0097539702419649

F. Fomin and D. Thilikos, A Simple and Fast Approach for Solving Problems on Planar Graphs, 22nd Annual Symposium on Theoretical Aspect of Computer Science (STACS), pp.56-67, 2004.
DOI : 10.1007/978-3-540-24749-4_6

F. Fomin and D. Thilikos, Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up, 31st International Colloquium on Automata , Languages, and Programming (ICALP), pp.581-592, 2004.
DOI : 10.1007/978-3-540-27836-8_50

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974.
DOI : 10.1016/0095-8956(74)90094-X

M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

T. Kloks, J. Kratochvil, and H. Müller, New Branchwidth Territories, 16th Ann, pp.173-183, 1999.
DOI : 10.1007/3-540-49116-3_16

T. Kloks, J. Kratochvil, and H. Müller, Computing the branchwidth of interval graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.266-145, 2005.
DOI : 10.1016/j.dam.2004.01.015

F. Mazoit, A general scheme for deciding the branchwidth, p.34, 2004.

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, Call routing and the ratcatcher, Combinatorica, vol.32, issue.2, pp.217-241, 1994.
DOI : 10.1007/BF01215352