Simultaneous Embedding of Colored Graphs
-
Published:2021-01-24
Issue:3
Volume:37
Page:747-760
-
ISSN:0911-0119
-
Container-title:Graphs and Combinatorics
-
language:en
-
Short-container-title:Graphs and Combinatorics
Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Bläsius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook on graph drawing and visualization, pp. 349–381. Chapman and Hall/CRC, Boca Raton (2013) 2. Brandes, U., Erten, C., Estrella-Balderrama, A., Fowler, J.J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S.G., Liotta, G., Mutzel, P., Symvonis, A.: Colored simultaneous geometric embeddings and universal pointsets. Algorithmica 60(3), 569–592 (2011) 3. Braß, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117–130 (2007) 4. Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: $$k$$-colored point-set embeddability of outerplanar graphs. J. Graph Algorithms Appl. 12(1), 29–49 (2008) 5. Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Comput. Geom. 30(1), 1–23 (2005)
|
|