Pages that link to "Item:Q1920418"
From MaRDI portal
The following pages link to Drawing planar graphs using the canonical ordering (Q1920418):
Displaying 36 items.
- Algorithms for Drawing Planar p-petal Graphs (Q2831832) (← links)
- Mondshein sequences (a.k.a. (2,1)-orders) (Q2832896) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Bitonic st-orderings for Upward Planar Graphs (Q2961518) (← links)
- How to Draw a Planarization (Q2971142) (← links)
- Planar and Poly-arc Lombardi Drawings (Q3223963) (← links)
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints (Q3611859) (← links)
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges (Q4575650) (← links)
- Windrose Planarity (Q4629968) (← links)
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS (Q4675884) (← links)
- Geodesic obstacle representation of graphs (Q5002693) (← links)
- Optimal orthogonal drawings of triconnected plane graphs (Q5054824) (← links)
- Orthogonal drawing of high degree graphs with small area and few bends (Q5096952) (← links)
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
- How to Draw a Planarization (Q5233140) (← links)
- Drawing Planar Graphs on Area (Q5300977) (← links)
- Schnyder woods for higher genus triangulated surfaces (abstract) (Q5300992) (← links)
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
- The (3,1)-ordering for 4-connected planar triangulations (Q5739847) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Imbalance parameterized by twin cover revisited (Q5925526) (← links)
- Grid drawings of 4-connected plane graphs (Q5939541) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
- Drawing planar graphs with circular arcs (Q5944937) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- An efficient orthogonal grid drawing algorithm for cubic graphs (Q6064011) (← links)
- Strictly-convex drawings of 3-connected planar graphs (Q6117042) (← links)
- Sliding column model for t-unit bar visibility representations of graphs (Q6174768) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- \((t, s)\)-completely independent spanning trees (Q6575408) (← links)
- Unit-length rectangular drawings of graphs (Q6636988) (← links)
- Structural parameters of Schnyder woods (Q6646404) (← links)
