Skip to main content
SpringerLink
Log in
Book cover

The Many Facets of Graph Theory pp 199–205Cite as

Critically and minimally n-connected graphs

  • Conference paper
  • First Online:

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

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Chartrand, A graph-theoretic approach to a communications problem, J. SIAM Appl. Math., 14 (1966), 118–181.

    Article  MathSciNet  MATH  Google Scholar 

  2. G. Chartrand and F. Harary, Graphs with prescribed connectivites, Theory of Graphs, Proceedings of the Colloquium Held at Tihany Hungary, 1968, 61–63.

    Google Scholar 

  3. G. Chartrand, A. Kaugars, and D.R. Lick, Critically n-connected graphs, submitted for publication.

    Google Scholar 

  4. G.A. Dirac, Minimally 2-connected graphs, J. Reine Angew. Math., 228 (1967), 204–216.

    MathSciNet  MATH  Google Scholar 

  5. F. Harary, Graph Theory, Addison-Wesley, 1969.

    Google Scholar 

  6. R. Halin, A theorem on n-connected graphs, J. Combinatorial Theory, to appear.

    Google Scholar 

  7. A. Kaugars, A Theorem on the Removal of Vertices from Blocks, Senior Thesis, Kalamazoo College, 1968.

    Google Scholar 

  8. D.R. Lick, Connectivity preserving subgraphs, Mathematical Report No. 1, Western Michigan University, July 1968.

    Google Scholar 

  9. D.R. Lick, Edge connectivity preserving subgraphs, Mathematical Report No. 7, Western Michigan University, September 1968.

    Google Scholar 

  10. M.D. Plummer, On minimal blocks, Trans. Amer. Math. Soc., 134 (1968), 85–94.

    Article  MathSciNet  MATH  Google Scholar 

  11. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math., 54 (1932), 150–168.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Western Michigan University, USA

    R. Don Lick

Authors
  1. R. Don Lick
    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

Don Lick, R. (1969). Critically and minimally n-connected 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/BFb0060118

Download citation

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

  • 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