We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a ...

We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no ...