Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs (Q1800412): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Revision as of 02:18, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs |
scientific article |
Statements
Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs (English)
0 references
23 October 2018
0 references
generating function
0 references
outerplanar graph
0 references
polygon dissection
0 references
restricted graph class
0 references
asymptotic enumeration
0 references
limit law
0 references
