Counting Outerplanar Maps

descriptionPublicationkeyboard_double_arrow_right Article 13 Apr 2017Publisher:The Electronic Journal of CombinatoricsJournal:The Electronic Journal of Combinatorics, volume 24 (eissn: 1077-8926,

Copyright policy )

Authors: Ivan Geffner; Marc Noy;

doi: 10.37236/6249

Counting Outerplanar Maps

- Summary
- Subjects
- Metrics

Abstract

A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths. As a consequence of our results, we obtain an efficient scheme for encoding simple outerplanar maps.

Related Organizations

Cornell University
United States
Universitat Politècnica de Catalunya
Spain

Keywords

outerplanar map, map enumeration, Exact enumeration problems, generating functions, Dyck path, Enumeration in graph theory, Planar graphs; geometric and topological aspects of graph theory

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

1

Average

gold

Fields of Science (3) View all

Fields of Science