Skip to main content
SpringerLink
Log in
SpringerLink
Log in

An algorithm for the directed T-immersion of a graph

  • Conference paper
  • First Online:
Graph Theory Singapore 1983

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1073))

  • 511 Accesses

Abstract

In this paper, a general algorithm to T-immerse a graph in the plane is proposed. The computer programme of this algorithm is also given.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wu Wen-Tsun, A mathematical problem in design for integrated circuit, J. Mathematics in practice and theory, 1 (1973), 20–40 [Chinese].

    Google Scholar 

  2. Wu Wen-Tsun, On the realization of complexes in euclidean spaces, I. Acta Math. Sinica, 5, (1955), 505–552; II. Acta Math. Sinica, 1, (1957), 80–101; III. Acta Math. Sinica, 8, (1958), 79–94. [Chinese]

    MathSciNet  MATH  Google Scholar 

  3. Liu Yan-pei, Modulo-2 programming and planar embeddings, Acta Math. Appl. Sinica, Vol. 1, No. 4 (1978), 321–329. [Chinese]

    MathSciNet  Google Scholar 

  4. Liu Yan-pei, Planarity testing and planar embeddings of graphs, Acta Math. Appl. Sinica, Vol. 2, No. 4 (1979), 350–365. [Chinese]

    MathSciNet  Google Scholar 

  5. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1, 2 (June 1972), 146–159.

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Hopcroft and R. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21, 4 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  7. E. M. Reingold, J. Nievergelt and N. Deo, Combinational Algorithms, Prentice-Hall, 1977.

    Google Scholar 

  8. H. Siefert and W. Threlfall, Topology, Dresden, 1934.

    Google Scholar 

  9. R. K. Guy, T. Jenkyns and J. Schaer, The toroidal crossing number of the complete graph, J. Comb. Theory, 4 (1968), 376–390.

    Article  MathSciNet  MATH  Google Scholar 

  10. H. Harborth and I. Mengersen, Edges without crossing in drawings of complete graphs, J. Comb. Theory ser. B, 17 (1974), 299–311.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. L. Gross and S. R. Alpert, Branched coverings of graph imbeddings, Bull. Amer. Math. Soc. 79 (1973), 942–945.

    Article  MathSciNet  MATH  Google Scholar 

  12. D. E. Knuth, The Art of Computer Programming, Addison-Wesley, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Fang Wei-Wu

Authors
  1. Fang Wei-Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Khee Meng Koh Hian Poh Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Wei-Wu, F. (1984). An algorithm for the directed T-immersion of a graph. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073125

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13368-1

  • Online ISBN: 978-3-540-38924-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation