Genus Distributions of cubic series-parallel graphs
Discrete Mathematics
2014-07-31 v1 Combinatorics
Abstract
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.
Cite
@article{arxiv.1407.8031,
title = {Genus Distributions of cubic series-parallel graphs},
author = {Jonathan L. Gross and Michal Kotrbčík and Timothy Sun},
journal= {arXiv preprint arXiv:1407.8031},
year = {2014}
}
Comments
21 pages