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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
