The following pages link to How to Draw a Graph (Q5724435):
Displaying 50 items.
- Self-organizing maps for drawing large graphs (Q293353) (← links)
- Non-planar extensions of subdivisions of planar graphs (Q326819) (← links)
- Extending convex partial drawings of graphs (Q334920) (← links)
- Removable paths and cycles with parity constraints (Q402593) (← links)
- Feature-based 3D morphing based on geometrically constrained spherical parameterization (Q426180) (← links)
- Spanning trees with nonseparating paths (Q501078) (← links)
- Straight line triangle representations (Q517440) (← links)
- Drawing polytopal graphs with {\texttt{polymake}} (Q600948) (← links)
- Independent paths and \(K_{5}\)-subdivisions (Q602715) (← links)
- Contractible small subgraphs in \(k\)-connected graphs (Q604980) (← links)
- Non-separating subgraphs after deleting many disjoint paths (Q618034) (← links)
- An analysis and comparison of parameterization-based computation of differential quantities for discrete surfaces (Q625266) (← links)
- Graph spectra in computer science (Q627958) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Non-separating even cycles in highly connected graphs (Q653835) (← links)
- Embedding a triangular graph within a given boundary (Q654561) (← links)
- Contractible triples in highly connected graphs (Q659608) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- A polynomial time circle packing algorithm (Q686175) (← links)
- Simple and optimal output-sensitive construction of contour trees using monotone paths (Q705555) (← links)
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits (Q705881) (← links)
- Cycle bases of graphs and sampled manifolds (Q733440) (← links)
- The Kelmans-Seymour conjecture. IV: A proof (Q777491) (← links)
- Automatic surface mesh generation for discrete models -- a complete and automatic pipeline based on reparametrization (Q782027) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- How to cage an egg (Q803943) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Spherical parametrization of genus-zero meshes by minimizing discrete harmonic energy (Q863842) (← links)
- Acute triangulations of the regular dodecahedral surface (Q875045) (← links)
- Barycentric systems and stretchability (Q885280) (← links)
- Non-separating subgraphs in highly connected graphs (Q905893) (← links)
- Unique embeddings of simple projective plane polyhedral maps (Q908935) (← links)
- Non-separating cycles and discrete Jordan curves (Q913818) (← links)
- Embeddings of graphs with no short noncontractible cycles (Q916669) (← links)
- Geometric realization of a triangulation on the projective plane with one face removed (Q946688) (← links)
- Homogeneity analysis using absolute deviations (Q957137) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Removing circuits in 3-connected binary matroids (Q1011697) (← links)
- Long cycles in 4-connected planar graphs (Q1011776) (← links)
- Minor and minimum cycle bases of a 3-connected planar graph (Q1034289) (← links)
- Feature-sensitive parameterization of polygonal meshes (Q1036553) (← links)
- A spherical parameterization approach based on symmetry analysis of triangular meshes (Q1045662) (← links)
- Graph-encoded 3-manifolds (Q1070585) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
