> Details

Brandes, Ulrik [Author]; Erten, Cesim [Author]; Fowler, James [Author]; Frati, Fabrizio [Author]; Geyer, Markus [Author]; Gutwenger, Carsten [Author]; Hong, Seokhee [Author]; Kaufmann, Michael [Author]; Kobourov, Stephen G. [Author]; Liotta, Giuseppe [Author]

Colored Simultaneous Geometric Embeddings

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Electronic Conference Proceeding; Text
  • Title: Colored Simultaneous Geometric Embeddings
  • Contributor: Brandes, Ulrik [Author]; Erten, Cesim [Author]; Fowler, James [Author]; Frati, Fabrizio [Author]; Geyer, Markus [Author]; Gutwenger, Carsten [Author]; Hong, Seokhee [Author]; Kaufmann, Michael [Author]; Kobourov, Stephen G. [Author]; Liotta, Giuseppe [Author]
  • imprint: KOPS - The Institutional Repository of the University of Konstanz, 2007
  • Language: English
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored paths and (2) a 2-colored outerplanar graph together with any number of 2-colored paths. We also show that there does not exist a universal pointset of size n for paths colored with five colors. We finally show that the following simultaneous embeddings are not possible: (1) three 6-colored cycles, (2) four 6-colored paths, and (3) three 9-colored paths. ; published
  • Access State: Open Access
  • Rights information: Attribution - Non Commercial - No Derivs (CC BY-NC-ND)