Number of Crossing-Free Geometric Graphs vs. Triangulations (Q5301006): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q54308706, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Triangulations intersect nicely / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic combinatorics of non-crossing configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flipping edges in triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601549 / rank
 
Normal rank

Revision as of 15:01, 6 July 2024

scientific article; zbMATH DE number 6182789
Language Label Description Also known as
English
Number of Crossing-Free Geometric Graphs vs. Triangulations
scientific article; zbMATH DE number 6182789

    Statements

    Number of Crossing-Free Geometric Graphs vs. Triangulations (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    crossing-free geometric graphs
    0 references
    number of triangulations
    0 references
    counting
    0 references

    Identifiers