Category:Matroidal Methods in Graph Theory
Every graph gives rise to a matroid so every theorem for matroids has an immediate consequence for graphs, although many of these are easy to derive directly. On the other hand, numerous results for graphs have analogs or generalizations to matroids.
Category:Algebraic graph theoryPages in category "Category:Matroidal Methods in Graph Theory"
- File:2-2 base.jpg
- File:2-2 joins.jpg
- File:Bicircular matroid.svg
- File:Eulerian matroid.svg
- File:Free matroid.svg
- File:Gammoid.svg
- File:Graph-matroid-n3.jpg
- File:Graph-matroid.jpg
- File:Graphic matroid of C4.svg
- File:Graphic matroid parity.svg
- File:Independence complex.svg
- File:Partition matroid.svg
- File:Set system examples.svg
- File:Thagomizer graph.svg
- File:Thagomizer-graph.svg
