Jonathan L. Gross ; Michal Kotrbčík ; Timothy Sun - Genus distributions of cubic series-parallel graphs

dmtcs:2099 - Discrete Mathematics & Theoretical Computer Science, August 1, 2014, Vol. 16 no. 3 -
Genus distributions of cubic series-parallel graphsArticle

Authors: Jonathan L. Gross 1; Michal Kotrbčík 2; Timothy Sun 1

  • 1 Department of Computer Science [New York]
  • 2 Institute of Computer Science [Brno]

We 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.

Volume: Vol. 16 no. 3
Section: Graph Theory
Published on: August 1, 2014
Submitted on: May 10, 2012
Keywords: graph embedding,genus distribution,series-parallel graphs,bounded treewidth,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 365 times.
This article's PDF has been downloaded 537 times.