Embedding Graphs Simultaneously with Fixed Edges

DOI10.1007/978-3-540-70904-6_12MaRDI QIDQ3595487zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_12

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) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited in

(17)

• Computing Upward Topological Book Embeddings of Upward Planar Digraphs
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
• Bundled Crossings in Embedded Graphs
• On the complexity of simultaneous geometric embedding for edge-disjoint graphs
• Matched drawability of graph pairs and of graph triples
• Colored simultaneous geometric embeddings and universal pointsets
• Computing upward topological book embeddings of upward planar digraphs
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• Simultaneous embeddings with few bends and crossings
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Simultaneous Embedding
• Edge frames of graphs: A graph embedding problem
• The QuaSEFE problem
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph

This page was built for publication: Embedding Graphs Simultaneously with Fixed Edges

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