Embedding Graphs Simultaneously with Fixed Edges
From MaRDI portal
Publication:3595487
DOI10.1007/978-3-540-70904-6_12zbMath1185.68476OpenAlexW1524396467MaRDI QIDQ3595487
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
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ The QuaSEFE problem ⋮ Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Colored simultaneous geometric embeddings and universal pointsets ⋮ Matched drawability of graph pairs and of graph triples ⋮ An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges ⋮ Simultaneous Embedding
This page was built for publication: Embedding Graphs Simultaneously with Fixed Edges
