H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998.
DOI : 10.1016/S0304-3975(97)00228-4

R. [. Borie, C. A. Parker, and . Tovey, Solving problems on recursively constructed graphs, ACM Computing Surveys, vol.41, issue.1, pp.1-51, 2009.
DOI : 10.1145/1456650.1456654

]. R. Du65 and . Duffin, Topology of series-parallel networks, J. Math. Analysis and Applications, vol.10, pp.303-318, 1965.

J. L. Gross, Genus distribution of graphs under surgery: adding edges and splitting vertices, New York J. Mathematics, vol.16, pp.161-178, 2010.

]. J. Gr11a and . Gross, Genus distribution of graph amalgamations: Self-pasting at root-vertices, Australasian J. Combin, vol.49, pp.19-38, 2011.

]. J. Gr11b and . Gross, Genus distributions of cubic outerplanar graphs, J. of Graph Algorithms and Applications, vol.15, pp.295-316, 2011.

J. L. Gross, Embeddings of cubic Halin graphs: genus distributions, Ars Math, Contemporanea, vol.6, pp.37-56, 2013.

]. J. Gr14 and . Gross, Embeddings of graphs of fixed treewidth and bounded degree, Ars Math, Contemporanea, vol.7, pp.379-403, 2014.

J. L. Gross and M. Furst, Hierarchy for imbedding-distribution invariants of a graph, Journal of Graph Theory, vol.12, issue.2, pp.205-220, 1987.
DOI : 10.1002/jgt.3190110211

I. [. Gross, M. I. Khan, and . Poshni, Genus distribution of graph amalgamations: Pasting at root-vertices, Ars Combin, vol.94, pp.33-53, 2010.

K. Kawarabayashi, B. Mohar, and B. Reed, A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.771-780, 2008.
DOI : 10.1109/FOCS.2008.53

M. [. Khan, J. L. Poshni, and . Gross, Genus distribution of graph amalgamations at roots of higher degree, Ars Math, Contemporanea, vol.3, pp.121-138, 2010.

M. [. Khan, J. L. Poshni, and . Gross, Genus distribution of P 3 × P n , Discrete Math, pp.312-2863, 2012.

M. I. Poshni, I. F. Khan, and J. L. Gross, Genus distribution of edge-amalgamations, Ars Math, Contemporanea, vol.3, pp.69-86, 2010.

I. [. Poshni, J. L. Khan, and . Gross, Genus distribution of 4-regular outerplanar graphs, Electronic J. Combin, vol.18, p.25, 2011.

M. I. Poshni, I. F. Khan, and J. L. Gross, Genus distribution of graphs under self-edgeamalgamations , Ars Math, Contemporanea, vol.5, pp.127-148, 2012.

]. C. Th89 and . Thomassen, The graph genus problem is NP-complete, J. Algorithms, vol.10, pp.568-576, 1989.