(X) ? 1, hence d X1 (y) ? d Y (y) ? 1. Moreover d Y1 (x) ? 2|Y | + 5 ? e(X) ? e(X) + 5 ? d X (x) + 5, all, we have e(X 1 , Y 1 ) ? e(X, Y ) ? 4 ? ,
Chordal embeddings of planar graphs, Discrete Math, pp.1-273, 2003. ,
DOI : 10.1016/S0012-365X(03)00230-9
On the excluded minors for the matroids of branch-width k, Journal of Combinatorial Theory, Series B, vol.88, issue.2, pp.88-261, 2003. ,
DOI : 10.1016/S0095-8956(02)00046-1
The branchwidth of graphs and their cycle matroids, preprint ,
Treewidth and duality for planar hypergraphs, preprint ,
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