On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Bandwidth of theta graphs with short paths
Discrete Mathematics
On the characteristic polynomial of homeomorphic images of a graph
Proceedings of the international conference on Combinatorics '94
Characterizing planarity using theta graphs
Journal of Graph Theory
SIAM Journal on Discrete Mathematics
On the chromatic roots of generalized theta graphs
Journal of Combinatorial Theory Series B
Embedding problems for paths with direction constrained edges
Theoretical Computer Science
Embedding Problems for Paths with Direction Constrained Edges
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
3D Graph Drawing with Simulated Annealing
GD '95 Proceedings of the Symposium on Graph Drawing
COMAIDE: Information Visualization using Cooperative 3D Diagram Layout
GD '95 Proceedings of the Symposium on Graph Drawing
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
The edge-bandwidth of theta graphs
Journal of Graph Theory
| Hi-index | 0.00 |
The recent interest in three dimensional graph drawing has been motivating studies on how to extend two dimensional techniques to higher dimensions. A common approach for computing a 2D orthogonal drawing ofa graph separates the task of defining the shape ofthe drawing from the task of computing its coordinates. First results towards finding a three-dimensional counterpart of this approach are presented in [8,9], where characterizations of orthogonal representations of paths and cycles are studied. In this note we show that the known characterization for cycles does not immediately extend to even seemingly simple graphs such as theta graphs. A sufficient condition for recognizing three-dimensional orthogonal representations oftheta graphs is also presented.