Pages that link to "Item:Q973017"
From MaRDI portal
The following pages link to Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017):
Displaying 18 items.
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- The point-set embeddability problem for plane graphs (Q2875647) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- Orthogeodesic Point-Set Embedding of Trees (Q3223943) (← links)
- Colored Point-Set Embeddings of Acyclic Graphs (Q4625132) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- k-colored Point-set Embeddability of Outerplanar Graphs (Q5301427) (← links)
- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge (Q5452234) (← links)
- Graph Drawing (Q5711612) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- On 1-bend upward point-set embeddings of \(st\)-digraphs (Q6547912) (← links)
