Counting outerplanar maps

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/108706

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.contributor.author	Geffner, I.
dc.contributor.author	Noy Serrano, Marcos
dc.date	2017-04-13
dc.identifier.citation	Geffner, I., Noy, M. Counting outerplanar maps. "Electronic journal of combinatorics", 13 Abril 2017, vol. 24, núm. 2, p. 1-8.
dc.identifier.citation	1077-8926
dc.identifier.uri	http://hdl.handle.net/2117/108706
dc.language.iso	eng
dc.relation	http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p3/pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subject	Classificació AMS::05 Combinatorics
dc.title	Counting outerplanar maps
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.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 e cient scheme for encoding simple outerplanar maps.
dc.description.abstract	Peer Reviewed