Simultaneous Graph Embeddings with Fixed Edges
DOI10.1007/11917496_29zbMATH Open1167.05311DBLPconf/wg/GassnerJPSS06OpenAlexW1486249760WikidataQ56456201 ScholiaQ56456201MaRDI QIDQ3522969FDOQ3522969
Authors:
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/507/2/zaik2006-507.pdf
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (24)
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Hanani--Tutte and Hierarchical Partial Planarity
- The complexity of simultaneous geometric graph embedding
- Simultaneous representation of proper and unit interval graphs
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Simultaneous Geometric Graph Embeddings
- Simultaneous embedding of embedded planar graphs
- Simultaneous embedding of embedded planar graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Disconnectivity and relative positions in simultaneous embeddings
- Small Point-Sets Supporting Graph Stories
- Parameterized complexity of simultaneous planarity
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- On the simultaneous minimum spanning trees problem
- Simultaneous Embedding
- Drawing Simultaneously Embedded Graphs with Few Bends
- Characterizing simultaneous embedding with fixed edges
- Simple realizability of complete abstract topological graphs in P
- Advancements on SEFE and partitioned book embedding problems
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Graph Simultaneous Embedding Tool, GraphSET
- Partial and simultaneous transitive orientations via modular decompositions
This page was built for publication: Simultaneous Graph Embeddings with Fixed Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522969)
