Pages that link to "Item:Q5493895"
From MaRDI portal
The following pages link to ON EMBEDDING A GRAPH ON TWO SETS OF POINTS (Q5493895):
Displaying 15 items.
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Improved algorithms for the point-set embeddability problem for plane 3-trees (Q2905309) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- (Q3484855) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- Colored Point-Set Embeddings of Acyclic Graphs (Q4625132) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)