The following pages link to Graph Drawing (Q5711605):
Displaying 13 items.
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Two trees which are self-intersecting when drawn simultaneously (Q1011769) (← links)
- Simultaneous embedding of a planar graph and its dual on the grid (Q1780846) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (Q3611849) (← links)
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs (Q4540529) (← links)
- Simultaneous Embedding of Planar Graphs with Few Bends (Q5301376) (← links)
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges (Q5302051) (← links)
- Constrained Simultaneous and Near-Simultaneous Embeddings (Q5452230) (← links)
- Algorithms and Data Structures (Q5900758) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)
