Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Graphic matroid
open-in-new
<p>In the mathematical theory of <a href="/facts/Matroid_theory/5bLcGlRF">matroids</a>, a graphic matroid (also called a cycle matroid or polygon matroid) is a <a href="/facts/Matroid/5bLcGlRF">matroid</a> whose independent sets are the <a href="/facts/Tree_(graph_theory)/TCWk4Joy">forests</a> in a given finite <a href="/facts/Undirected_graph/kw3eIBUe">undirected graph</a>. The <a href="/facts/Dual_matroid/nonzVrpu">dual matroids</a> of graphic matroids are called co-graphic matroids or bond matroids. A matroid that is both graphic and co-graphic is sometimes called a planar matroid (but this should not be confused with matroids of rank 3, which generalize planar point configurations); these are exactly the graphic matroids formed from <a href="/facts/Planar_graph/plREagr9">planar graphs</a>. </p>