Skip to main content
SpringerLink
Log in

Topological Graph Layouts into a Triangular Prism

  • Conference paper
  • First Online:
Discrete and Computational Geometry and Graphs (JCDCGG 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9943))

Included in the following conference series:

  • 793 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dujmović, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553–579 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dujmović, V., Pór, A., Wood, D.R.: Track layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 497–522 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Dujmović, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7, 155–202 (2005)

    MathSciNet  MATH  Google Scholar 

  4. Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 363–398 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398–412 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927–958 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Wood, D.R.: Queue layouts of graph products and powers. Discrete Math. Theor. Comput. Sci. 7(1), 255–268 (2005)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Communication Science Laboratories, NTT Corporation, Atsugi-shi, Japan

    Miki Miyauchi

Authors
  1. Miki Miyauchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Miki Miyauchi .

Editor information

Editors and Affiliations

  1. Tokyo University of Science , Tokyo, Japan

    Jin Akiyama

  2. The University of Electro-Communications , Tokyo, Japan

    Hiro Ito

  3. Tokai University , Tokyo, Japan

    Toshinori Sakai

  4. Osaka Prefecture University , Sakai, Japan

    Yushi Uno

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Miyauchi, M. (2016). Topological Graph Layouts into a Triangular Prism. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2015. Lecture Notes in Computer Science(), vol 9943. Springer, Cham. https://doi.org/10.1007/978-3-319-48532-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48532-4_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48531-7

  • Online ISBN: 978-3-319-48532-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation