Pages that link to "Item:Q959802"

The following pages link to Drawing colored graphs on colored points (Q959802):

Displaying 23 items.

• Alternating paths and cycles of minimum length (Q340546) (← links)
• Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
• \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
• On upward point set embeddability (Q1947995) (← links)
• A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
• Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
• On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
• Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← 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)
• Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
• Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
• Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← 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)
• Small Point-Sets Supporting Graph Stories (Q6141788) (← links)
• On 1-bend upward point-set embeddings of \(st\)-digraphs (Q6547912) (← links)