Disjoint Edges in Geometric Graphs.
Discrete & computational geometry (1989)
- Volume: 4, Issue: 4, page 287-290
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
topHow to cite
topErdös, P., and Alon, N.. "Disjoint Edges in Geometric Graphs.." Discrete & computational geometry 4.4 (1989): 287-290. <http://eudml.org/doc/131080>.
@article{Erdös1989,
author = {Erdös, P., Alon, N.},
journal = {Discrete & computational geometry},
keywords = {combinatorial geometry; configuration; three pairwise disjoint line segments},
number = {4},
pages = {287-290},
title = {Disjoint Edges in Geometric Graphs.},
url = {http://eudml.org/doc/131080},
volume = {4},
year = {1989},
}
TY - JOUR
AU - Erdös, P.
AU - Alon, N.
TI - Disjoint Edges in Geometric Graphs.
JO - Discrete & computational geometry
PY - 1989
VL - 4
IS - 4
SP - 287
EP - 290
KW - combinatorial geometry; configuration; three pairwise disjoint line segments
UR - http://eudml.org/doc/131080
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.