A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
[chapter]
2008
Lecture Notes in Computer Science
Hamiltonicity, book embeddability, and point-set embeddability 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 O(k) bends per edge.
doi:10.1007/978-3-540-77537-9_31
fatcat:xw4gximprrb6tkgbsbilgenzyy