TOPICS
Search

Graphic Matroid


A graphic matroid is a matroid (E,C) obtained from a pseudograph G, where E is the edge set of G and C is the family of edge sets of graph cycles of G. The family C obeys the axioms for the circuits of a matroid.


See also

Matroid, Pseudograph

This entry contributed by Dillon Mayhew

Explore with Wolfram|Alpha

References

Oxley, J. G. Matroid Theory. Oxford, England: Oxford University Press, p. 11, 1991.

Referenced on Wolfram|Alpha

Graphic Matroid

Cite this as:

Weisstein, Eric W., with contributions by Dillon Mayhew. "Graphic Matroid." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GraphicMatroid.html

Subject classifications