A Note on the Area Requirement of Euclidean Greedy Embeddings of Christmas Cactus Graphs

Roman Prutkin

An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices $s$ and $t$, the vertex $s$ has a neighbor $v$ with smaller…