Colored simultaneous geometric embeddings and universal pointsets

DOI10.1007/s00453-010-9433-xzbMath1218.68183OpenAlexW2133165331WikidataQ56977091 ScholiaQ56977091MaRDI QIDQ548667

Petra Mutzel, Michael Kaufmann, Giuseppe Liotta, Carsten Gutwenger, Alejandro Estrella-Balderrama, J. Joseph Fowler, Cesim Erten, Seok-Hee Hong, Markus Geyer, Fabrizio Frati, Antonios Symvonis, Ulrik Brandes, Stephen G. Kobourov

Publication date: 30 June 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-179994

zbMATH Keywords

graph drawingcolored simultaneous embeddingsimultaneous embeddingsimultaneous geometric embeddinguniversal pointsets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Universal point sets for 2-coloured trees ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Simultaneous embedding of colored graphs ⋮ Planar drawings of fixed-mobile bigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• On simultaneous planar graph embeddings
• Characterization of unlabeled level planar trees
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Bipartite embeddings of trees in the plane
• On embedding an outer-planar graph in a point set
• Embedding Graphs Simultaneously with Fixed Edges
• Simultaneous Embedding of Planar Graphs with Few Bends
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Minimum Level Nonplanar Patterns for Trees
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Graph Drawing