[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, II

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In Part I a graph theoretical tool was presented to construct elementary strong maps of graphic matroids, and it was conjectured that every such map arises in this way. An example of Jeff Kahn disproves this conjecture but leads to a generalization of the original strong map construction.

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. Kahn, J.: private communication via T. Brylawski, December 10, (1990)

  2. Recski, A.: Elementary strong maps of graphic matroids. Graphs and Combinatorics3, 379–382 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Piff, M.J., Welsh, D.J.A.: On the vector representation of matroids. J. London Math. Soc.2, 284–288 (1970)

    Article  MathSciNet  Google Scholar 

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, II. Graphs and Combinatorics 10, 205–206 (1994). https://doi.org/10.1007/BF02986665

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation