Some properties of k-Delaunay and k-Gabriel graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190154" target="_blank" >RIV/00216208:11320/13:10190154 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1016/j.comgeo.2012.04.006" target="_blank" >http://dx.doi.org/10.1016/j.comgeo.2012.04.006</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.comgeo.2012.04.006" target="_blank" >10.1016/j.comgeo.2012.04.006</a>

Result language

angličtina

Original language name

Some properties of k-Delaunay and k-Gabriel graphs

Original language description

We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, connectivity, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computational Geometry: Theory and Applications

ISSN

0925-7721

e-ISSN

—

Volume of the periodical

46

Issue of the periodical within the volume

2

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

9

Pages from-to

131-139

UT code for WoS article

000311017800003

EID of the result in the Scopus database

—