The following pages link to Bemerkungen zum Vierfarbenproblem (Q2645092):
Displayed 50 items.
- Making triangulations 4-connected using flips (Q390117) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- A lower bound on the diameter of the flip graph (Q521362) (← links)
- On the mixing time of the flip walk on triangulations of the sphere (Q524867) (← links)
- \(N\)-flips in even triangulations on the torus and Dehn twists preserving monodromies (Q539862) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges (Q634247) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Vertex unfoldings of tight polyhedra (Q743671) (← links)
- Bemerkungen zu Hadwigers Vermutung (Q773174) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- \(N\)-flips in 4-connected even triangulations on the sphere (Q897249) (← links)
- Flips in planar graphs (Q950400) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Representing orders on the plane by translating convex figures (Q1114721) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- Lattices contained in planar orders are planar (Q1208077) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Diagonal flips in triangulations on closed surfaces with minimum degree at least 4 (Q1305524) (← links)
- On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427) (← links)
- Every triangle-free planar graph has a planar upward drawing (Q1311415) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- Diagonal transformations of graphs and Dehn twists of surfaces (Q1362098) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- Geometric quadrangulations of a polygon (Q1792062) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Regular flip equivalence of surface triangulations (Q1868890) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry (Q1926115) (← links)
- A generalization of diagonal flips in a convex polygon (Q1978713) (← links)
- Flipping in spirals (Q1984590) (← links)
- Flip graphs of stacked and flag triangulations of the 2-sphere (Q2138560) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Diagonal flips in plane graphs with triangular and quadrangular faces (Q2192087) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)