https://hal.inria.fr/hal-01188913Gross, Jonathan L.Jonathan L.GrossDepartment of Computer Science [New York] - Columbia University [New York]Kotrbčík, MichalMichalKotrbčíkICS / MUNI - Institute of Computer Science [Brno] - MUNI - Masaryk University [Brno]Sun, TimothyTimothySunDepartment of Computer Science [New York] - Columbia University [New York]Genus distributions of cubic series-parallel graphsHAL CCSD2014graph embeddinggenus distributionseries-parallel graphsbounded treewidth[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Episciences Iam, Coordination2015-08-31 17:03:512020-12-18 19:10:032015-09-01 13:27:21enJournal articleshttps://hal.inria.fr/hal-01188913/document10.46298/dmtcs.2099application/pdf1We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of every graph of treewidth 2 are series-parallel graphs, this yields, by use of bar-amalgamation, a quadratic-time algorithm for every graph of treewidth at most 2 and maximum degree at most 3.