Mostra el registre d'ítem simple

dc.contributor.authorNoy Serrano, Marcos
dc.contributor.authorRequilé, Clément
dc.contributor.authorRué Perna, Juan José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2020-06-23T06:43:50Z
dc.date.available2020-06-23T06:43:50Z
dc.date.issued2019-08-01
dc.identifier.citationNoy, M.; Requilé, C.; Rue, J. Enumeration of labelled 4-regular planar graphs. "Proceedings of the London Mathematical Society", 1 Agost 2019, vol. 119, núm. 2, p. 358-378.
dc.identifier.issn0024-6115
dc.identifier.urihttp://hdl.handle.net/2117/191331
dc.description.abstractWe present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular planar graphs can be computed effectively as the solution of a system of equations, from which the coefficients can be extracted. As a byproduct, we also enumerate labelled 3-connected 4-regular planar graphs, and simple 4-regular rooted maps.
dc.description.sponsorshipM. N. was supported by the Spanish Ministerio de Economia y Competitividad projects MTM2014- 54745-P, MDM-2014-0445 and MTM2017-82166-P. C. R. was supported by the Special Research Program F50 Algorithmic and Enumerative Combinatorics of the Austrian Science Fund. J. R. was supported by the Spanish Ministerio de Economia y Competitividad projects MTM2014-54745-P, MDM-2014-0445 and MTM2017-82166-P
dc.format.extent21 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.otherPlanar graphs
dc.titleEnumeration of labelled 4-regular planar graphs
dc.typeArticle
dc.contributor.groupUniversitat Politècnica de Catalunya. Geometric, Algebraic and Probabilistic Combinatorics
dc.identifier.doi10.1112/plms.12234
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.relation.publisherversionhttps://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/plms.12234
dc.rights.accessOpen Access
local.identifier.drac23935313
dc.description.versionPostprint (author's final draft)
local.citation.authorNoy, M.; Requilé, C.; Rue, J.
local.citation.publicationNameProceedings of the London Mathematical Society
local.citation.volume119
local.citation.number2
local.citation.startingPage358
local.citation.endingPage378


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple