The following pages link to (Q5786239):
Displaying 50 items.
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian (Q281632) (← links)
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← links)
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Reprint of: ``Grid representations and the chromatic number'' (Q390168) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- Feature-based 3D morphing based on geometrically constrained spherical parameterization (Q426180) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Pointed drawings of planar graphs (Q452448) (← links)
- Computing planarity in computable planar graphs (Q503647) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- Polyhedral suspensions of arbitrary genus (Q604990) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← 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)
- An extension of a fixed point problem for simple graphs (Q686510) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- A characterization of complete bipartite RAC graphs (Q765516) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- How to draw a planar graph on a grid (Q804582) (← 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)
- Acute triangulations of the regular dodecahedral surface (Q875045) (← links)
- Barycentric systems and stretchability (Q885280) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Geometric graphs which are 1-skeletons of unstacked triangulated polygons (Q998427) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← 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)
- Representing a planar graph by vertical lines joining different levels (Q1052327) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Fundamentals of planar ordered sets (Q1086596) (← links)
- A note on visibility graphs (Q1099193) (← links)
- Representing orders on the plane by translating convex figures (Q1114721) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
