Pages that link to "Item:Q947122"

The following pages link to Convex drawings of graphs with non-convex boundary constraints (Q947122):

Displaying 18 items.

• Extending convex partial drawings of graphs (Q334920) (← links)
• Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
• Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
• An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
• A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
• Untangling a planar graph (Q1042455) (← links)
• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
• One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
• Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
• Free edge lengths in plane graphs (Q2354683) (← links)
• A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
• Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• (Q5089197) (← links)
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
• Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)