In combinatorics, Fary imbedding is a representation of a planar graph as a planar straight line graph in which no two edges cross.

--back to combinatorics--

Log in or register to write something here or to contact authors.