Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs (Q1800412): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q129248407, #quickstatements; #temporary_batch_1723924200075
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963125657 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.03719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colored partitions of a convex polygon by noncrossing diagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and limit laws for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration and limit laws for graphs of fixed genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph statistics in subcritical graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic combinatorics of non-crossing configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of subgraphs of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration and limit laws of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with given 3-connected components: Asymptotic enumeration and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subgraphs of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs from a Minor-Closed Class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3370010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general dissections of a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are small subgraphs of a random graph normally distributed? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129248407 / rank
 
Normal rank

Latest revision as of 21:57, 17 August 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
    0 references
    23 October 2018
    0 references
    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
    0 references
    0 references
    0 references