Pages that link to "Item:Q1772134"
From MaRDI portal
The following pages link to Canonical ordering trees and their applications in graph drawing (Q1772134):
Displaying 20 items.
- Acyclic coloring with few division vertices (Q396683) (← links)
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- Visibility representations of four-connected plane graphs with near optimal heights (Q833713) (← links)
- Strictly-upward drawings of ordered search trees (Q1274319) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Orderly spanning trees with applications to graph encoding and graph drawing (Q2768340) (← links)
- Drawing Ordered (k − 1)–Ary Trees on k–Grids (Q3073664) (← links)
- More Canonical Ordering (Q3168834) (← links)
- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights (Q3611838) (← links)
- ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS (Q3646203) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
- Computing and Combinatorics (Q4681190) (← links)
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs (Q5321707) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
- The (3,1)-ordering for 4-connected planar triangulations (Q5739847) (← links)
- Graph Drawing (Q5897653) (← links)
- Algorithms and Data Structures (Q5900779) (← links)
- On the 3-tree core of plane graphs (Q6636077) (← links)
- On the oriented diameter of planar triangulations (Q6645167) (← links)
