Elementary strong maps of graphic matroids

DOI10.1007/BF01788560MaRDI QIDQ1106229zbMATH OpenOpenAlexFDO

Authors András Recski

Publication date 1987

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01788560

zbMATH Keywords

Elementary strong mapsgraphic matroidsstrong map relation

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Cites work

• Converting Linear Programs to Network Problems

Cited in

(6)

• Applications of combinatorics to statics --- a second survey
• Elementary strong maps of graphic matroids. II
• The category of matroids
• Maps of matroids with applications
• Cobiased graphs: single-element extensions and elementary quotients of graphic matroids
• Applications of combinatorics to statics -- rigidity of grids

This page was built for publication: Elementary strong maps of graphic matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106229)