Pages that link to "Item:Q5301376"
From MaRDI portal
The following pages link to Simultaneous Embedding of Planar Graphs with Few Bends (Q5301376):
Displaying 32 items.
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges (Q634247) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- Two trees which are self-intersecting when drawn simultaneously (Q1011769) (← links)
- Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
- Simultaneous embedding of colored graphs (Q2045370) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (Q2961545) (← links)
- Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
- On a Tree and a Path with no Geometric Simultaneous Embedding (Q3112624) (← links)
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES (Q3442763) (← links)
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← links)
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs (Q4540529) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Simultaneous Embeddings with Few Bends and Crossings (Q5233141) (← links)
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges (Q5302051) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
- Graph Drawing (Q5711605) (← links)
- Algorithms and Data Structures (Q5900758) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)
- Parameterized complexity of simultaneous planarity (Q6618252) (← links)
