Enumeration of labeled 4-regular planar graphs

In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic notes in discrete mathematics Ročník 61; s. 933 - 939
Hlavní autoři: Noy, Marc, Requilé, Clément, Rué, Juanjo
Médium: Journal Article Publikace
Jazyk:angličtina
Vydáno: Elsevier B.V 01.08.2017
Témata:
05 Combinatorics
05C Graph theory
Classificació AMS
generating functions
graph enumeration
Matemàtiques i estadística
planar graphs
Àrees temàtiques de la UPC
generating functions
planar graphs
graph enumeration
ISSN:1571-0653, 1571-0653
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic calculus. As a by-product, we can also compute the algebraic generating function counting labeled 3-connected 4-regular planar maps.
AbstractList In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic calculus. As a by-product, we can also compute the algebraic generating function counting labeled 3-connected 4-regular planar maps.
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic calculus. As a by-product, we can also compute the algebraic generating function counting labeled 3-connected 4-regular planar maps. Peer Reviewed
Author Rué, Juanjo
Requilé, Clément
Noy, Marc
Author_xml – sequence: 1
  givenname: Marc
  surname: Noy
  fullname: Noy, Marc
  email: marc.noy@upc.edu
  organization: Departament de Matemàtiques, Universitat Politècnica de Catalunya and Barcelona Graduate School of Mathematics, Spain
– sequence: 2
  givenname: Clément
  surname: Requilé
  fullname: Requilé, Clément
  email: requile@math.fu-berlin.de
  organization: Institut für Mathematik, Freie Universität Berlin and Berlin Mathematical School, Germany
– sequence: 3
  givenname: Juanjo
  surname: Rué
  fullname: Rué, Juanjo
  email: juan.jose.rue@upc.edu
  organization: Departament de Matemàtiques, Universitat Politècnica de Catalunya and Barcelona Graduate School of Mathematics, Spain
BookMark eNp9kM9qwzAMxs3oYG23F9gpL5DMcuI4gV1G6f5AYZftbFxb7lxSp9jpYG8_Zy1s7FAh8UmHn5C-GZn43iMht0ALoFDfbQv0ZlcwCqKgKXl9QabABeS05uXkT39FZjFuKS0bEHxKiqU_7DCowfU-623WqTV2aLIqD7g5dCpk-075JJug9h_xmlxa1UW8OemcvD8u3xbP-er16WXxsMo142LIK8MNtMw2WoHSvGk0KMEq5I2tbQpjta3adVNRAYyvQSAqqhHLljJbWSjnBI57dTxoGVBj0GqQvXK_w1iMCiZZW7FWJKY5MaGPMaCV2g0_jw1BuU4ClaNXcitHr-TolaQpeZ1Q9g_dB7dT4es8dH-EMBnx6TDIqB16jcalGwdpencO_wZN94UO
CitedBy_id crossref_primary_10_1112_jlms_70018
Cites_doi 10.1090/S0894-0347-08-00624-3
10.1002/jgt.3190170508
10.1016/j.disc.2005.10.005
10.1002/rsa.20149
10.1002/jgt.3190050412
ContentType Journal Article
Publication
Contributor Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
Universitat Politècnica de Catalunya. Departament de Matemàtiques
Contributor_xml – sequence: 1
  fullname: Universitat Politècnica de Catalunya. Departament de Matemàtiques
– sequence: 2
  fullname: Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
Copyright 2017 Elsevier B.V.
Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es
Copyright_xml – notice: 2017 Elsevier B.V.
– notice: Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a>
DBID AAYXX
CITATION
XX2
DOI 10.1016/j.endm.2017.07.056
DatabaseName CrossRef
Recercat
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0653
EndPage 939
ExternalDocumentID oai_recercat_cat_2072_294297
10_1016_j_endm_2017_07_056
S1571065317302214
GroupedDBID --K
--M
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABJNI
ABMAC
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACXMD
ADBBV
ADEZE
ADGUI
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AIEXJ
AIGVJ
AIKHN
AITUG
AJMQA
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
M41
MHUIS
MO0
M~E
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
XX2
ID FETCH-LOGICAL-c257t-4d5d192f8ca1ac588c1a724e58f6ffffdfcf49b8407125b17eea0cee3902f4f13
ISSN 1571-0653
IngestDate Fri Nov 07 13:41:49 EST 2025
Sat Nov 29 01:47:10 EST 2025
Tue Nov 18 22:51:12 EST 2025
Fri Feb 23 02:23:31 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Keywords generating functions
planar graphs
graph enumeration
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c257t-4d5d192f8ca1ac588c1a724e58f6ffffdfcf49b8407125b17eea0cee3902f4f13
OpenAccessLink https://recercat.cat/handle/2072/294297
PageCount 7
ParticipantIDs csuc_recercat_oai_recercat_cat_2072_294297
crossref_citationtrail_10_1016_j_endm_2017_07_056
crossref_primary_10_1016_j_endm_2017_07_056
elsevier_sciencedirect_doi_10_1016_j_endm_2017_07_056
PublicationCentury 2000
PublicationDate August 2017
2017-08-00
2017-08-01
PublicationDateYYYYMMDD 2017-08-01
PublicationDate_xml – month: 08
  year: 2017
  text: August 2017
PublicationDecade 2010
PublicationTitle Electronic notes in discrete mathematics
PublicationYear 2017
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Mullin, Schellenberg (br0060) 1958; 4
Brinkmann, Greenberg, Greenhill, McKay, Thomas, Wollan (br0020) 2005; 305
Broersma, Duijvestijn, Göbel (br0030) 1993; 17
Giménez, Noy (br0040) 2009; 22
Lehel (br0050) 1981; 5
Bodirsky, Kang, Löffler, McDiarmid (br0010) 2007; 30
Noy (br0070) 2014; vol. IV
M. Noy, C. Requilé, J. Rué, Random cubic planar graphs revisited, (in preparation).
Lehel (10.1016/j.endm.2017.07.056_br0050) 1981; 5
Bodirsky (10.1016/j.endm.2017.07.056_br0010) 2007; 30
Mullin (10.1016/j.endm.2017.07.056_br0060) 1958; 4
Giménez (10.1016/j.endm.2017.07.056_br0040) 2009; 22
Noy (10.1016/j.endm.2017.07.056_br0070) 2014; vol. IV
10.1016/j.endm.2017.07.056_br0080
Broersma (10.1016/j.endm.2017.07.056_br0030) 1993; 17
Brinkmann (10.1016/j.endm.2017.07.056_br0020) 2005; 305
References_xml – volume: 305
  start-page: 33
  year: 2005
  end-page: 54
  ident: br0020
  article-title: Generation of simple quadrangulations of the sphere
  publication-title: Discrete Math.
– volume: vol. IV
  start-page: 407
  year: 2014
  end-page: 430
  ident: br0070
  article-title: Random planar graphs and beyond
  publication-title: Proceedings of the International Conference of Mathematicians
– volume: 30
  start-page: 78
  year: 2007
  end-page: 94
  ident: br0010
  article-title: Random cubic planar graphs
  publication-title: Random Structures & Algorithms
– volume: 4
  start-page: 259
  year: 1958
  end-page: 276
  ident: br0060
  article-title: The enumeration of c-nets via quadrangulations
  publication-title: Discrete Math.
– volume: 22
  start-page: 309
  year: 2009
  end-page: 329
  ident: br0040
  article-title: Asymptotic enumeration and limit laws of planar graphs
  publication-title: J. Amer. Math. Soc.
– reference: M. Noy, C. Requilé, J. Rué, Random cubic planar graphs revisited, (in preparation).
– volume: 17
  start-page: 613
  year: 1993
  end-page: 620
  ident: br0030
  article-title: Generating all 3-connected 4-regular planar graphs from the octahedron graph
  publication-title: J. Graph Theory
– volume: 5
  start-page: 423
  year: 1981
  end-page: 426
  ident: br0050
  article-title: Generating all 4-regular planar graphs from the graph of the octahedron
  publication-title: J. Graph Theory
– volume: 22
  start-page: 309
  year: 2009
  ident: 10.1016/j.endm.2017.07.056_br0040
  article-title: Asymptotic enumeration and limit laws of planar graphs
  publication-title: J. Amer. Math. Soc.
  doi: 10.1090/S0894-0347-08-00624-3
– volume: vol. IV
  start-page: 407
  year: 2014
  ident: 10.1016/j.endm.2017.07.056_br0070
  article-title: Random planar graphs and beyond
– volume: 17
  start-page: 613
  year: 1993
  ident: 10.1016/j.endm.2017.07.056_br0030
  article-title: Generating all 3-connected 4-regular planar graphs from the octahedron graph
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190170508
– volume: 305
  start-page: 33
  year: 2005
  ident: 10.1016/j.endm.2017.07.056_br0020
  article-title: Generation of simple quadrangulations of the sphere
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2005.10.005
– ident: 10.1016/j.endm.2017.07.056_br0080
– volume: 30
  start-page: 78
  year: 2007
  ident: 10.1016/j.endm.2017.07.056_br0010
  article-title: Random cubic planar graphs
  publication-title: Random Structures & Algorithms
  doi: 10.1002/rsa.20149
– volume: 5
  start-page: 423
  year: 1981
  ident: 10.1016/j.endm.2017.07.056_br0050
  article-title: Generating all 4-regular planar graphs from the graph of the octahedron
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190050412
– volume: 4
  start-page: 259
  year: 1958
  ident: 10.1016/j.endm.2017.07.056_br0060
  article-title: The enumeration of c-nets via quadrangulations
  publication-title: Discrete Math.
SSID ssj0038175
Score 2.083911
Snippet In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition....
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ In this extended abstract, we...
SourceID csuc
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 933
SubjectTerms 05 Combinatorics
05C Graph theory
Classificació AMS
generating functions
graph enumeration
Matemàtiques i estadística
planar graphs
Àrees temàtiques de la UPC
Title Enumeration of labeled 4-regular planar graphs
URI https://dx.doi.org/10.1016/j.endm.2017.07.056
https://recercat.cat/handle/2072/294297
Volume 61
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20190331
  omitProxy: false
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: AIEXJ
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20191231
  omitProxy: false
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELZQxwMv_EYUGMoDT1SpYiep7UeEOk0IKgQD7c1KHFtqNdyRJmhP_O3cxU6abWgCJKo2TZ2mrnyXu8-X83eEvDIsWdiyTGJGU5igCKPjUlITl6BbEmY_WnZrq76-56uVOD2VH0NC5q4rJ8CdExcX8vy_ihraQNi4dPYvxD38KDTAPggdtiB22P6R4JcOl1QOSBCkDJ6lmmVx3ZWdr7FwtIO3jqp6dykyvy-J47aN8Zmya7ArAKxn3wZ-1wGFr3wc7wMM4HDfxnxv12f-7nsXgw374_yaT-3--Lu2cJvtOPQA7qxPfAvxsGtrYrwJ5ZhL5SmA5-Y3bcHuehL2YDhlmo58sPQER9fMu480bObGVcgiQLknXr3Cpd1558_YJ3ZJwYYxhrXODxgH_cP0zp_L3lsjQWHeceqGfxgWVvkcwKv9XAIvE71r9QjDjHDJyX1yN0woojdeER6QW8Y9JPf6Yh1RsN2PyHykF9HWRkEvokEvIq8XkdeLx-TL0fLk7XEcimXEGqxuE2dVXgFat0IXtNC5EJoWnGUmF3Zh4VFZbTNZCpzAs7yk3JgiAYSUyoTZzNL0CZm4rTNPSSSkzeAizWUleCZ0WWgA9VyUzOjMAoKdEtqPgtKBSR4LmpypPmVwo3DkFI6cSuCZL6ZkNpxz7nlUbvz2axxcBU7f1LpoFJKgDx_wxRLOFJOApviU5L0IVICNHg4qUJsbOnn2j-c9J3f2F8MLMmnq1hyS2_pHs97VLzvt-gVETYz0
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Enumeration+of+labeled+4-regular+planar+graphs&rft.jtitle=Electronic+notes+in+discrete+mathematics&rft.au=Noy%2C+Marc&rft.au=Requil%C3%A9%2C+Cl%C3%A9ment&rft.au=Ru%C3%A9%2C+Juanjo&rft.date=2017-08-01&rft.pub=Elsevier+B.V&rft.issn=1571-0653&rft.eissn=1571-0653&rft.volume=61&rft.spage=933&rft.epage=939&rft_id=info:doi/10.1016%2Fj.endm.2017.07.056&rft.externalDocID=S1571065317302214
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0653&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0653&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0653&client=summon