Abstract
A class of plane multigraphs having a series-parallel structure is defined and enumerated. The enumeration is carried out both for the rooted graphs as originally defined, and also for those where no distinctions are made between the vertices. Some other related problems are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gould, I. P. andJackson, D. M.,Combinatorial enumeration. John Wiley & Sons, Chichester, 1983.
Harary, F. andPalmer, E. M.,Graphical enumeration. Academic Press, New York, 1973.
Read, R. C.,On general dissections of a polygon. Aequationes Math.18 (1978), 307–388.
Read, R. C. andRosentsiehl, P.,On the principal tripartition of a graph. InAdvances in graph theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Ann. Discrete Math. 3 (1978), 195–226.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Read, R.C. On the enumeration of a class of plane multigraphs. Aeq. Math. 31, 47–63 (1986). https://doi.org/10.1007/BF02188172
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02188172