Skip to main content
SpringerLink
Log in

A survey of packings and coverings of graphs

  • Conference paper
  • First Online:
The Many Facets of Graph Theory

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

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. J. Battle, F. Harary, and Y. Kodama, Every planar graph with nine points has a non-planar complement. Bull. Amer. Math. Soc. 68 (1962), 569–571.

    Article  MathSciNet  MATH  Google Scholar 

  2. L.W. Beineke, Decompositions of complete graphs into forests. Publ. Math. Inst. Hungar. Acad. Sci. 9 (1964), 589–594.

    MathSciNet  MATH  Google Scholar 

  3. L.W. Beineke, Complete bipartite graphs: Decomposition into planar subgraphs. Chapter in A Seminar on Graph Theory, F. Harary, Ed. Holt, Rinehart and Winston, New York, 1967, pp. 42–53.

    Google Scholar 

  4. L.W. Beineke, The decomposition of complete graphs into planar subgraphs. Chapter in Graph Theory and Theoretical Physics, F. Harary, Ed. Academic Press, London, 1967, pp. 139–153.

    Google Scholar 

  5. L.W. Beineke, Minimal decompositions of complete graphs into subgraphs with embeddability properties. Canad. J. Math. 21 (1969). (to appear)

    Google Scholar 

  6. L.W. Beineke, Packings of complete bipartite graphs. (to appear)

    Google Scholar 

  7. L.W. Beineke and R.K. Guy, The coarseness of the complete bipartite graph. Canad. J. Math. 21 (1969) (to appear).

    Google Scholar 

  8. L.W. Beineke and F. Harary, The thickness of the complete graph. Canad. J. Math. 17 (1965), 850–859.

    Article  MathSciNet  MATH  Google Scholar 

  9. L.W. Beineke, F. Harary, and J.W. Moon, On the thickness of the complete bipartite graph. Proc. Camb. Phil. Soc. 60 (1964), 1–5.

    Article  MathSciNet  MATH  Google Scholar 

  10. G. Chartrand, D. Geller, and S. Hedetniemi, Graphs with forbidden subgraphs. J. Combinatorial Theory (to appear).

    Google Scholar 

  11. G. Chartrand and F. Harary, Planar permutation graphs. Ann. Inst. H. Poincare Sect B (N.S.) 3 (1967), 433–438.

    MathSciNet  MATH  Google Scholar 

  12. P. Franklin, A six-color problem, J. Math. Phys. 13 (1934), 363–369.

    Article  MATH  Google Scholar 

  13. R.K. Guy, A coarseness conjecture of Erdos. J. Combinatorial Theory 3 (1967), 38–42.

    Article  MathSciNet  MATH  Google Scholar 

  14. R.K. Guy, A many-facetted problem of Zarankiewicz. (this volume)

    Google Scholar 

  15. R.K. Guy and L.W. Beineke, The coarseness of the complete graph. Canad. J. Math. 20 (1968), 888–894.

    Article  MathSciNet  MATH  Google Scholar 

  16. A.M. Hobbs and J.W. Grossman, Thickness and connectivity in graphs. (to appear)

    Google Scholar 

  17. J. Mayer, L'epaisseur des graphes complets K34 et K40. J. Combinatorial Theory. (to appear)

    Google Scholar 

  18. C. St. J. A. Nash-Williams, Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961), 445–450.

    Article  MathSciNet  MATH  Google Scholar 

  19. C. St. J. A. Nash-Williams, Decomposition of finite graphs into forests. J. London Math. Soc. 39 (1964), 12.

    Article  MathSciNet  MATH  Google Scholar 

  20. G. Ringel, Die toroidale Dicke des vollständigen Graphen. Math. Zeitschr. 87 (1965), 19–26.

    Article  MathSciNet  MATH  Google Scholar 

  21. W.T. Tutte, On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 142 (1961), 221–230.

    Article  MathSciNet  MATH  Google Scholar 

  22. H. Walther, Über die Zerlegung des vollständigen Graphen in paare planare Graphen. Chapter in Beiträge zur Graphentheorie, H. Sachs, H.-J. Voss, and H. Walther, Eds. B.G. Teubner Verlag, Leipzig, 1968. pp. 189–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Purdue University at Fort Wayne, USA

    Lowell W. Beineke

Authors
  1. Lowell W. Beineke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Chartrand S. F. Kapoor

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Beineke, L.W. (1969). A survey of packings and coverings of graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060104

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04629-5

  • Online ISBN: 978-3-540-36161-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation