Colored Simultaneous Geometric Embeddings

DOI10.1007/978-3-540-73545-8_26MaRDI QIDQ3608850zbMATH OpenOpenAlexFDO

Authors

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_26

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Colored simultaneous geometric embeddings and universal pointsets
• Universal point sets for 2-coloured trees
• Universal pointsets for 2-coloured trees
• On the curve complexity of 3-colored point-set embeddings
• On simultaneous planar graph embeddings

Cited in

(11)

• Graph Simultaneous Embedding Tool, GraphSET
• scientific article; zbMATH DE number 6315534 (Why is no real title available?)
• Matched drawability of graph pairs and of graph triples
• Monotone simultaneous paths embeddings in \(\mathbb{R}^d\)
• Monotone simultaneous embeddings of paths in \(d\) dimensions
• Colored simultaneous geometric embeddings and universal pointsets
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Simultaneous embedding of colored graphs
• Universal point sets for 2-coloured trees
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• Universal pointsets for 2-coloured trees

This page was built for publication: Colored Simultaneous Geometric Embeddings

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