Lecture Notes in Computer Science Volume 4875, 2008, pp 315-326

Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access


Hamiltonicity, book embeddability, and point-set embedda- bility of planar graphs are strictly related concepts. We exploit the interplay between these notions to describe colored sets of points and to design polynomial-time algorithms to embed k-colored planar graphs on these sets such that the resulting drawings have $\mathcal{O}(k)$ bends per edge.