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.
Similar content being viewed by others
References
Kahn, J.: private communication via T. Brylawski, December 10, (1990)
Recski, A.: Elementary strong maps of graphic matroids. Graphs and Combinatorics3, 379–382 (1987)
Piff, M.J., Welsh, D.J.A.: On the vector representation of matroids. J. London Math. Soc.2, 284–288 (1970)
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02986665