Colored simultaneous geometric embeddings and universal pointsets
DOI10.1007/S00453-010-9433-XzbMATH Open1218.68183OpenAlexW2133165331WikidataQ56977091 ScholiaQ56977091MaRDI QIDQ548667FDOQ548667
Petra Mutzel, Michael Kaufmann, Giuseppe Liotta, Carsten Gutwenger, Alejandro Estrella-Balderrama, Stephen G. Kobourov, J. Joseph Fowler, Cesim Erten, Seok-Hee Hong, Markus Geyer, Fabrizio Frati, Ulrik Brandes, Antonios Symvonis
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
graph drawingcolored simultaneous embeddingsimultaneous embeddingsimultaneous geometric embeddinguniversal pointsets
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to draw a planar graph on a grid
- Rectilinear planar layouts and bipolar orientations of planar graphs
- On simultaneous planar graph embeddings
- Bipartite embeddings of trees in the plane
- Algorithms for plane representations of acyclic digraphs
- 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
- Characterization of unlabeled level planar trees
- Minimum Level Nonplanar Patterns for Trees
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Graph Drawing
Cited In (5)
This page was built for publication: Colored simultaneous geometric embeddings and universal pointsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548667)
