The following pages link to (Q3216670):
Displaying 50 items.
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Deformations of plane graphs (Q595673) (← links)
- Obstructions for embedding cubic graphs on the spindle surface (Q598469) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds (Q707019) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Rectangular-radial drawings of cubic plane graphs (Q991189) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Interval representations of planar graphs (Q1077425) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- A note on visibility graphs (Q1099193) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- A variational principle for circle packings. (Q1176645) (← links)
- Infinite connected graphs with no end-preserving spanning trees (Q1193567) (← links)
- Some results on visibility graphs (Q1201816) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes (Q1689958) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- Planar acyclic oriented graphs (Q1825205) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Special graph representation and visualization of semantic networks (Q1930194) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Aspect ratio universal rectangular layouts (Q2154083) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
- On orthogonally convex drawings of plane graphs (Q2360858) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- How to build a brick (Q2433703) (← links)
- A note on rectilinear and polar visibility graphs (Q2486070) (← links)
- Spherical-Rectangular Drawings (Q3605510) (← links)
- Non-convex Representations of Graphs (Q3611875) (← links)
- 3D Visibility Representations of 1-planar Graphs (Q4625104) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- Homothetic triangle representations of planar graphs (Q5240366) (← links)
- How to Morph Planar Graph Drawings (Q5737811) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- Rectangular drawings of plane graphs without designated corners (Q5959556) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
- Rectangular grid drawings of plane graphs (Q6142896) (← links)
- Aspect ratio universal rectangular layouts (Q6601455) (← links)
