Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

DOI10.1016/j.disc.2018.08.027zbMath1397.05016arXiv1802.03719OpenAlexW2963125657WikidataQ129248407 ScholiaQ129248407MaRDI QIDQ1800412

Vasiliki Velona

Publication date: 23 October 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03719

zbMATH Keywords

generating functionasymptotic enumerationouterplanar graphlimit lawpolygon dissectionrestricted graph class

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colored partitions of a convex polygon by noncrossing diagonals
• Small subgraphs of random regular graphs
• When are small subgraphs of a random graph normally distributed?
• On general dissections of a polygon
• Analytic combinatorics of non-crossing configurations
• Asymptotic enumeration and limit laws for graphs of fixed genus
• Enumeration and limit laws for series-parallel graphs
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Asymptotic enumeration and limit laws of planar graphs
• Random Trees
• Random Graphs from a Minor-Closed Class
• Subgraph statistics in subcritical graph classes
• Distribution of subgraphs of random regular graphs