Skip to main content
SpringerLink
Log in

Generalized pseudosurface embeddings of graphs and associated block designs

  • Conference paper
  • First Online:
Theory and Applications of Graphs

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

  • 1524 Accesses

Abstract

In this paper we discuss recent results concerning the embedding of graphs into topological spaces which differ from surfaces at only finitely many points, called generalized pseudosurfaces. Such graph embeddings can be associated with certain classes of block designs. We will review the correspondences between graph embeddings and block designs, and then we will discuss some implications of these relationships to the constructing of new block designs as well as to the constructing and analyzing of proper graph embeddings.

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. S. R. Alpert, Twofold Triple Systems and Graph Embeddings. J. Combinatorial Theory (A) 18 (1975), 101–107.

    Article  MathSciNet  MATH  Google Scholar 

  2. K. N. Bhattacharya, A Note on Two-fold Triple Systems. Sankhyā 6 (1943), 313–314.

    MATH  Google Scholar 

  3. R. C. Bose and K. R. Nair, Partially Balanced Incomplete Block Designs. Sankhyā 4 (1939), 337–372.

    Google Scholar 

  4. J. Doyen, Construction of Disjoint Steiner Triple Systems. Proc. Amer. Math. Soc. 32 (1972), 409–416.

    Article  MathSciNet  MATH  Google Scholar 

  5. J. R. Edmonds, A Combinatorial Representation for Polyhedral Surfaces. Notices Amer. Math. Soc. 7(1960), 646.

    Google Scholar 

  6. A. Emch, Triple and Multiple Systems; Their Geometric Configurations and Groups. Trans. Amer. Math. Soc. 31 (1929), 25–42.

    Article  MathSciNet  MATH  Google Scholar 

  7. B. L. Garman, R. D. Ringeisen and A. T. White, On the Genus of Strong Tensor Products of Graphs. Submitted for publication.

    Google Scholar 

  8. J. E. Graver, The Imbedding Index of a Graph. Submitted for publication.

    Google Scholar 

  9. J. L. Gross, Voltage Graphs. Discrete Math. 9 (1974), 239–246.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. K. Guy and J. W. T. Youngs, A Smooth and Unified Proof of Cases 6, 5 and 3 of the Ringel-Youngs Theorem. J. Combinatorial Theory (B) 15 (1973), 1–11.

    Article  MathSciNet  MATH  Google Scholar 

  11. H. Hanani, The Existence and Construction of Balanced Incomplete Block Designs. Ann. Math. Stat. 32 (1961), 361–386.

    Article  MathSciNet  MATH  Google Scholar 

  12. H. Hanani, Balanced Incomplete Block Designs and Related Designs. Discrete Math. 11 (1975), 255–369.

    Article  MathSciNet  MATH  Google Scholar 

  13. M. Hall, Combinatorial Theory, Ginn-Blaisdell, Waltham, Massachusetts (1967).

    MATH  Google Scholar 

  14. P. J. Heawood, Map Colour Theorem. Quart. J. Math. 24 (1890), 332–338.

    Google Scholar 

  15. L. Heffter, Über das Problem der Nachbargebiete. Math. Ann. 38 (1891), 477–508.

    Article  MathSciNet  MATH  Google Scholar 

  16. L. Heffter, Über Triplesysteme. Math. Ann. 49 (1897), 101–112.

    Article  MathSciNet  MATH  Google Scholar 

  17. F. K. Hwang and S. Lin, A Direct Method to Construct Triple Systems. J. Combinatorial Theory (A) 17 (1974), 84–94.

    Article  MathSciNet  MATH  Google Scholar 

  18. E. S. Kramer, Indecomposable Triple Systems. Discrete Math. 8 (1974), 173–180.

    Article  MathSciNet  MATH  Google Scholar 

  19. S. MacLane, A Combinatorial Condition for Planar Graphs. Fund. Math. 28 (1937), 22–32.

    MATH  Google Scholar 

  20. N. S. Mendelsohn, A Natural Generalization of Steiner Triple Systems. Proc. Sci. Res. Council Atlas Sympos. No. 2 Oxford (1969), 323–338.

    Google Scholar 

  21. E. M. Landesman and J. W. T. Youngs, Smooth Solutions in Case 1 of the Heawood Conjecture for Non-orientable Surfaces. J. Combinatorial Theory (B) 13 (1972), 26–39.

    Article  MathSciNet  MATH  Google Scholar 

  22. W. S. Massey, Algebraic Topology: An Introduction. Harcourt, Brace and World, Inc., New York (1967).

    MATH  Google Scholar 

  23. W. Petroelje, Imbedding Graphs on Pseudosurfaces. Specialist Thesis, Western Michigan University, Kalamazoo, Michigan (1971).

    Google Scholar 

  24. G. Ringel and J. W. T. Youngs, Solution of the Heawood Map-Coloring Problem. Proc. Nat. Acad. Sci. U.S.A. 60 (1969), 343–353.

    MathSciNet  Google Scholar 

  25. G. Ringel, Map Color Theorem. Springer-Verlag, Berlin (1974).

    Book  MATH  Google Scholar 

  26. J. VanBuggenhaut, On the Existence of 2-designs S2(2, 3,v) Without Repeated Blocks, Discrete Math. 8 (1974), 105–109.

    Article  MathSciNet  Google Scholar 

  27. A. T. White, Graphs, Groups and Surfaces. North-Holland, Amsterdam (1973).

    MATH  Google Scholar 

  28. A. T. White, Block Designs and Graph Imbeddings. Western Michigan University Mathematics Report #41, Kalamazoo, Michigan (1975).

    Google Scholar 

  29. J. W. T. Youngs, Minimal Imbeddings and the Genus of a Graph. J. Math. Mech. 12 (1963), 303–315.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Syracuse University, Syracuse, New York, 13210, USA

    Clare E. Heidema

Authors
  1. Clare E. Heidema
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heidema, C.E. (1978). Generalized pseudosurface embeddings of graphs and associated block designs. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070383

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation