GRAPH‐REALIZABILITY OF MATROIDS
Thomas Inukai, Louis Weinberg · Annals of the New York Academy of Sciences · 1979
S ummary A graph‐realizability algorithm of a general matroid is presented in this paper. A matroid is first decomposed into maximal 3‐connected minors called atoms and the original matroid is graph‐realizable if and only if all the atoms are graph‐realizable. Each atom is reduced to a wheel or a whirl matroid by reduction and contraction operations. The graph‐realizability of an atom is tested at each step of the reconstruction process. Two examples are included to illustrate the algorithm.