Skip to main content
SpringerLink
Log in

Theoretical results on at most 1-bend embeddability of graphs

  • Study Bulletin
  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Y. Liu, A Morgana and B. Simeone, General Theoretical Results on Rectilinear Embeddability of Graphs, Tech. Rep., Dept. of Statistics, University “La Sapienza” Roma, 1990. Also seeActa Math. Appl. Sinica (Eng. Series),7(1991), 187–192.

  2. Y. Liu, Boolean Approach to Planar Embeddings of a Graph,Acta Math. Sinica, New Series 5(1989), 64–79.

    Google Scholar 

  3. R. Raghavan, J. Cohoon and S. Sahni, Single-bend Wiring,Journal of Algorithms,7(1986), 232–257.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Academia Sinica, 100080, Beijing, China

    Liu Yanpei

  2. Department of Mathematics, University of Rome “La Sapienza”, Rome, Italy

    Paola Marchioro & Rossella Petreschi

  3. Department of Statistics, University of Rome “La Sapienza”, Rome, Italy

    Bruno Simeone

Authors
  1. Liu Yanpei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paola Marchioro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rossella Petreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bruno Simeone
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Y., Marchioro, P., Petreschi, R. et al. Theoretical results on at most 1-bend embeddability of graphs. Acta Mathematicae Applicatae Sinica 8, 188–192 (1992). https://doi.org/10.1007/BF02006154

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02006154

Keywords

Search

Navigation