Simultaneous Graph Embeddings with Fixed Edges

DOI10.1007/11917496_29MaRDI QIDQ3522969zbMATH OpenOpenAlexDBLPWikidataFDO

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Simultaneous embedding of embedded planar graphs
• Characterizing simultaneous embedding with fixed edges
• Simultaneous embedding of embedded planar graphs
• Simultaneous Geometric Graph Embeddings

Cited in

(24)

• Graph Simultaneous Embedding Tool, GraphSET
• Partial and simultaneous transitive orientations via modular decompositions
• 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
• Disconnectivity and relative positions in simultaneous embeddings
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• 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
• Simple realizability of complete abstract topological graphs in P
• Characterizing simultaneous embedding with fixed edges
• Drawing Simultaneously Embedded Graphs with Few Bends
• Advancements on SEFE and partitioned book embedding problems
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph

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)