Prism layouts are special cases of track layouts of graphs. A triangular prism layout for graphs is a graph layout into a triangular prism that carries the vertices along the three crests between two triangles of the prism and the edges in the three rectangular surfaces such that no two edges cross in the interior of the surfaces. Also, a topological prism layout for graphs is defined so that edges are allowed to cross the crests. As for topological prism layouts, it is desirable to have good bounds on number of edge-crossings over crests for various classes of graphs. This paper constructs two-color-edge topological triangular prism layouts for complete bipartite graphs with fewer edge-crossings over the crests than previous results.
[1]
Pat Morin,et al.
Layout of Graphs with Bounded Tree-Width
,
2004,
SIAM J. Comput..
[2]
David R. Wood,et al.
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
,
2005,
Discret. Math. Theor. Comput. Sci..
[3]
David R. Wood,et al.
Queue Layouts of Graph Products and Powers
,
2005,
Discret. Math. Theor. Comput. Sci..
[4]
Arnold L. Rosenberg,et al.
Comparing Queues and Stacks as Mechanisms for Laying out Graphs
,
1992,
SIAM J. Discret. Math..
[5]
Lenwood S. Heath,et al.
Laying out Graphs Using Queues
,
1992,
SIAM J. Comput..