An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs

DOI10.17223/20710410/59/4MaRDI QIDQ6168403zbMATH OpenFDO

Authors V. A. Voblyj

Publication date 8 August 2023

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/pdm794

zbMATH Keywords

asymptoticsblockenumerationlabelled graphpentacyclic graphplanar graphprobabilitytetracyclic graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The number of labeled outerplanar k-cyclic graphs
• The number of labeled 2-connected planar graphs
• On \((p,1)\)-total labelling of planar graphs
• Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• Asymptotic enumeration of labelled graphs by genus
• scientific article; zbMATH DE number 279643
• Asymptotic enumeration and limit laws of planar graphs

Cited in

(1)

• Enumeration of labeled Eulerian pentacyclic graphs

This page was built for publication: An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168403)