On the number of plane geometric graphs (Q2373434): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/gc/AichholzerHHHKV07, #quickstatements; #temporary_batch_1731530891435
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q61732493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating order types for small point sets with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing number of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity minimizes pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of triangulations of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract order type extension and new results on the rectilinear crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pseudo-triangulations of certain point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic combinatorics of non-crossing configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polytope of non-crossing graphs on a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better upper bound on the number of triangulations of a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of crossing-free matchings, (cycles, and partitions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossing‐Free Matchings, Cycles, and Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/gc/AichholzerHHHKV07 / rank
 
Normal rank

Latest revision as of 22:14, 13 November 2024

scientific article
Language Label Description Also known as
English
On the number of plane geometric graphs
scientific article

    Statements

    On the number of plane geometric graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2007
    0 references
    acyclic graphs
    0 references
    double zig-zag chain
    0 references

    Identifiers