Pages that link to "Item:Q5301427"

The following pages link to k-colored Point-set Embeddability of Outerplanar Graphs (Q5301427):

Displaying 15 items.

• Alternating paths and cycles of minimum length (Q340546) (← links)
• Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
• On upward point set embeddability (Q1947995) (← links)
• Simultaneous embedding of colored graphs (Q2045370) (← links)
• On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
• Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
• The point-set embeddability problem for plane graphs (Q2875647) (← links)
• Improved algorithms for the point-set embeddability problem for plane 3-trees (Q2905309) (← links)
• Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
• Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
• Colored Point-Set Embeddings of Acyclic Graphs (Q4625132) (← links)
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge (Q5452234) (← links)
• Embedding k-Outerplanar Graphs into l1 (Q5470821) (← links)
• 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
• 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)