Elementary strong maps of graphic matroids

DOI10.1007/BF01788560zbMath0651.05023OpenAlexW4243479980MaRDI QIDQ1106229

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

graphic matroidsElementary strong mapsstrong map relation

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

• Converting Linear Programs to Network Problems

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