Constrained simultaneous and near-simultaneous embeddings

DOI10.7155/JGAA.00194MaRDI QIDQ3402370zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov

Publication date 4 February 2010

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00194

zbMATH Keywords

geometric simultaneous embedding

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Constrained Simultaneous and Near-Simultaneous Embeddings
• Planar and Quasi Planar Simultaneous Geometric Embedding
• On simultaneous planar graph embeddings
• Geometric simultaneous embeddings of a graph and a matching
• Geometric simultaneous embeddings of a graph and a matching

Cited in

(8)

• On a tree and a path with no geometric simultaneous embedding
• On a tree and a path with no geometric simultaneous embedding
• Simultaneous Embedding
• Simultaneous embeddings with few bends and crossings
• Critical imbeddings with multivariate rearrangements
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Geometric simultaneous embeddings of a graph and a matching
• Matched drawability of graph pairs and of graph triples

This page was built for publication: Constrained simultaneous and near-simultaneous embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402370)