Pages that link to "Item:Q1011769"
From MaRDI portal
The following pages link to Two trees which are self-intersecting when drawn simultaneously (Q1011769):
Displaying 8 items.
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← links)
- Simultaneous Embeddings with Few Bends and Crossings (Q5233141) (← links)
