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

From MaRDI portal
Revision as of 20:57, 17 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129248407, #quickstatements; #temporary_batch_1723924200075)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers