Sign Up to like & get
recommendations!
1
Published in 2021 at "Symmetry"
DOI: 10.3390/sym13061050
Abstract: Let P be a set of n≥3 points in general position in the plane. The edge disjointness graph D(P) of P is the graph whose vertices are the n2 closed straight line segments with endpoints…
read more here.
Keywords:
disjointness graph;
connectivity;
graph;
upper bound ... See more keywords