The following pages link to (Q3102944):
Displaying 35 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- The topological drawing of a graph: construction methods (Q386927) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Invariants of graph drawings in the plane (Q778122) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps (Q1681355) (← links)
- Bend-optimal orthogonal drawings of triconnected plane graphs (Q1713568) (← links)
- Image-based graph visualization: advances and challenges (Q1725727) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- How traders influence their neighbours: modelling social evolutionary processes and peer effects in agricultural trade networks (Q2661653) (← links)
- Minimal Delaunay triangulations of hyperbolic surfaces (Q2690130) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- Finding Triangles for Maximum Planar Subgraphs (Q2980925) (← links)
- Drawing Planar Graphs with Prescribed Face Areas (Q3181055) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- On Upward Drawings of Trees on a Given Grid (Q4625120) (← links)
- Crossing Layout in Non-planar Graph Drawings (Q5001663) (← links)
- On the Edge-Length Ratio of 2-Trees (Q5014107) (← links)
- On Edge-Length Ratios of Partial 2-Trees (Q5072225) (← links)
- EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH (Q5150702) (← links)
- PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) (Q5150740) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time (Q5452155) (← links)
- Level-planar drawings with few slopes (Q5918990) (← links)
- Methods for determining cycles of a specific length in undirected graphs with edge weights (Q6181338) (← links)
