PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Henk G. Meijer / rank
Normal rank
 
Property / author
 
Property / author: Henk G. Meijer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the planar Euclidean relative neighbourhood graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected size of some graphs in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expected maximum degree of Gabriel and Yao graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average length of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homogeneous planar Poisson point process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-Hamiltonian, nondegenerate Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: 20‐relative neighborhood graphs are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On crossing numbers of geometric proximity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nearest-neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circles containing the maximum number of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal results on circles containing points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circles through two points that always enclose many points / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195912500112 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044795021 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:47, 30 July 2024

scientific article; zbMATH DE number 6180176
Language Label Description Also known as
English
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
scientific article; zbMATH DE number 6180176

    Statements

    PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    0 references
    geometric graphs
    0 references
    proximity graphs
    0 references
    graph-theoretic properties
    0 references
    0 references