Drawing colored graphs with constrained vertex positions and few bends per edge

Authors:
Emilio Di Giacomo;Giuseppe Liotta;Francesco Trotta
Affiliations:
Dip. di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia;Dip. di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia;Dip. di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 3
Cited 1

Curve-constrained drawings of planar graphs

Computational Geometry: Theory and Applications
k-colored point-set embeddability of outerplanar graphs

GD'06 Proceedings of the 14th international conference on Graph drawing
Drawing colored graphs on colored points

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Constrained Point-Set Embeddability of Planar Graphs

Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.