PROXIMITY GRAPHS: E, delta, Delta, chi AND omega

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10190156" target="_blank" >RIV/00216208:11320/12:10190156 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1142/S0218195912500112" target="_blank" >http://dx.doi.org/10.1142/S0218195912500112</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218195912500112" target="_blank" >10.1142/S0218195912500112</a>

Result language

angličtina

Original language name

PROXIMITY GRAPHS: E, delta, Delta, chi AND omega

Original language description

Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated. We first consider some of the most common proximity graphs of the family of the Delaunay graph, and study their number of edges, minimum and maximum degree, clique number, and chromatic number. In the second part of the paper we focus on the higher order versions of some of these graphs and give bounds on the same parameters.

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

2012

Confidentiality

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

Name of the periodical

International Journal of Computational Geometry and Applications

ISSN

0218-1959

e-ISSN

—

Volume of the periodical

22

Issue of the periodical within the volume

5

Country of publishing house

GB - UNITED KINGDOM

Number of pages

31

Pages from-to

439-469

UT code for WoS article

000315158000004

EID of the result in the Scopus database

—