Abstract
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers n ≥ 1 and g ≥ 3, let \({\cal G}_3(n,g)\) denote the set of all triconnected rooted plane graphs with exactly n vertices such that the size of each inner face is at most g. In this paper, we give an algorithm that enumerates all plane graphs in \({\cal G}_3(n,g)\). The algorithm runs in constant time per each by outputting the difference from the previous output.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fujiwara, H., Wang, J., Zhao, L., Nagamochi, H., Akutsu, T.: Enumerating tree-like chemical graphs with given path frequency. Journal of Chemical Information and Modeling 48, 1345–1357 (2008)
Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: STOC 1974, pp. 172–184 (1974)
Horváth, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proc. 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 197–206 (2006)
Imada, T., Ota, S., Nagamochi, H., Akutsu, T.: Enumerating stereoisomers of tree structured molecules using dynamic programming. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 14–23. Springer, Heidelberg (2009)
Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T.: Improved algorithm for enumerating tree-like chemical graphs. In: Genome Informatics, GIW 2008, vol. 21, pp. 53–64 (2008)
Li, Z., Nakano, S.: Efficient generation of plane triangulations without repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 433–443. Springer, Heidelberg (2001)
Nakano, S.: Efficient generation of plane trees. IPL 84, 167–172 (2002)
Nakano, S.: Efficient generation of triconnected plane triangulations. In: Computational Geometry Theory and Applications, vol. 27(2), pp. 109–122 (2004)
Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-005 (2003)
Read, R.C.: How to avoid isomorphism search when cataloguing combinatorial configurations. Annals of Discrete Mathematics 2, 107–120 (1978)
Tutte, W.T.: Convex representations of graphs. Proc. of London Math. Soc. 10(3), 304–320 (1960)
Steinitz, E.: Polyeder und Raumeinteilungen. Encyclopädie der mathematischen Wissenschaften, Band 3 (Geometrie), Teil 3AB12, 1–139 (1922)
Yamanaka, K., Nakano, S.: Listing all plane graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 210–221. Springer, Heidelberg (2008)
Zhuang, B., Nagamochi, H.: Enumerating rooted biconnected planar graphs with internally triangulated faces, Kyoto University, Technical Report 2009-018 (2009), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical_report/TR2009-018.pdf
Zhuang, B., Nagamochi, H.: Efficient generation of symmetric and asymmetric biconnected rooted outerplanar graphs. In: AAAC 2010, p. 21 (2010)
Zhuang, B., Nagamochi, H.: Enumerating biconnected rooted plane graphs, Kyoto University, Technical Report 2010-001 (2010), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical_report/TR2010-001.pdf
Zhuang, B., Nagamochi, H.: Constant time generation of biconnected rooted plane graphs. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 113–123. Springer, Heidelberg (2010)
Zhuang, B., Nagamochi, H.: Enumerating rooted graphs with reflectional block structures. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 49–60. Springer, Heidelberg (2010)
Zhuang, B., Nagamochi, H.: Generating internally triconnected rooted plane graphs. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 467–478. Springer, Heidelberg (2010)
Zhuang, B., Nagamochi, H.: Listing triconnected rooted plane graphs, Kyoto University, Technical Report 2010-002 (2010), http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical_report/TR2010-002.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhuang, B., Nagamochi, H. (2010). Listing Triconnected Rooted Plane Graphs. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)