Genus distributions of cubic series-parallel graphs
From MaRDI portal
Publication:2928586
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.
Recommendations
Cited in
(9)- Genus distributions for iterated claws
- The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus
- Genus distributions of 4-regular outerplanar graphs
- Genus distribution for a graph
- Recursive formulas for embedding distributions of cubic outerplanar graphs
- Euler-genus distributions of cubic caterpillar-Halin graphs
- Embeddings of cubic Halin graphs: genus distributions
- Embeddings of graphs of fixed treewidth and bounded degree
- Enumerating graph embeddings and partial-duals by genus and Euler genus
This page was built for publication: Genus distributions of cubic series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928586)