[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Elementary strong maps of graphic matroids

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Elementary strong maps of graphic matroids are described in terms of the graph only. An application to rigidity of special bar and joint frameworks is also mentioned.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bixby, R.E., Cunningham, W.H.: Converting linear programs to network problems. Math. Oper. Res.5, 321–357 (1980)

    Google Scholar 

  2. Bolker, E., Crapo, H.: How to brace a one-story building? Environment and Planning (B)4, 125–152 (1977)

    Google Scholar 

  3. Crapo, H.: More on the bracing of one-story buildings. Environment and Planning (B)4, 153–156 (1977)

    Google Scholar 

  4. Recski, A.: Matroid Theory and Its Applications. Publishing House of the Hungarian Academy of Sciences/Springer (to appear)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Recski, A. Elementary strong maps of graphic matroids. Graphs and Combinatorics 3, 379–382 (1987). https://doi.org/10.1007/BF01788560

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation