Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

Subhas Kumar Ghosh, Koushik Sinha

A greedy embedding of a graph $G=(V,E)$ into a metric space $(X,d)$ is a function $x:V(G)\to X$ such that in the embedding for every pair of non-adjacent vertices $x(s),x(t)$…