Characterizing simultaneous embedding with fixed edges

DOI10.1016/J.ENDM.2008.06.006MaRDI QIDQ5300978zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.06.006

zbMATH Keywords

fixed edgessimultaneous embedding of planar graphssimultaneous embedding with fixed edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• 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
• Simultaneous embedding of embedded planar graphs
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• Simultaneous Graph Embeddings with Fixed Edges

Cites work

• On simultaneous planar graph embeddings
• Simultaneous Geometric Graph Embeddings
• Simultaneous Graph Embeddings with Fixed Edges

Cited in

(16)

• The QuaSEFE problem
• Disconnectivity and relative positions in simultaneous embeddings
• On the simultaneous minimum spanning trees problem
• SEFE without mapping via large induced outerplane graphs in plane graphs
• SEFE with no mapping via large induced outerplane graphs in plane graphs
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• Simultaneous embedding of embedded planar graphs
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Simultaneous embedding of embedded planar graphs
• Simultaneous Graph Embeddings with Fixed Edges
• Disconnectivity and relative positions in simultaneous embeddings
• Testing simultaneous planarity when the common graph is 2-connected
• Simultaneous Embedding
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• Matched drawability of graph pairs and of graph triples

This page was built for publication: Characterizing simultaneous embedding with fixed edges

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