Communicating Centrality in Policy Network Drawings
IEEE Transactions on Visualization and Computer Graphics
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
Simultaneous graph embedding with bends and circular arcs
Computational Geometry: Theory and Applications
Characterization of unlabeled level planar trees
Computational Geometry: Theory and Applications
Unlabeled level planarity
Characterization of unlabeled level planar trees
GD'06 Proceedings of the 14th international conference on Graph drawing
Characterization of unlabeled level planar graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
| Hi-index | 0.00 |
Suppose that an n-vertex graph has a distinct labeling with the integers {1, . . . ,n}. Such a graph is radial level planar if it admits a crossings-free drawing under two constraints. First, each vertex lies on a concentric circle such that the radius of the circle equals the label of the vertex. Second, each edge is drawn with a radially monotone curve. We characterize the set of unlabeled radial level planar(URLP) graphs that are radial level planar in terms of 7 and 15 forbidden subdivisions depending on whether the graph is disconnected or connected, respectively. We also provide linear-time drawing algorithms for any URLP graph.