Equivalent factor matroids of graphs


The factor matroid of a graphG is the matric matroid of the vertex-edge incidence matrix ofG interpreted over the real numbers. This paper presents a constructive characterization of the graphs hat have the same factor matroid as a given 4-connected bipartite graph.

This is a preview of subscription content, access via your institution.


  1. [1]

    J. A. Bondy andU. S. R. Murty, Graph Theory with Applications, North-Holland, New York, 1976.

    Google Scholar 

  2. [2]

    M. Doob, An interrelation between line graphs, eigenvalues and matroids, Journal of Combinatorial Theory, Series B15 (1973), 40–50.

    Google Scholar 

  3. [3]

    J. M. S. Simoes-Pereira, On matroids on edge sets of graphs with connected subgraphs as circuits I, Discrete Mathematics12 (1975), 55–78.

    Article  Google Scholar 

  4. [4]

    W. T.Tutte, On chain-groups and the factors of graph,Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai, Szeged, Hungary, 1978.

  5. [5]

    D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.

    Google Scholar 

  6. [6]

    H. Whitney, 2-Isomorphic graphs, American Journal of Mathematics55 (1933), 245–254.

    MathSciNet  Google Scholar 

  7. [7]

    T. Zaslavsky, Signed graphs, Discrete Applied Mathematics4 (1982), 47–74.

    Article  Google Scholar 

Download references

Author information



Additional information

Research partially supported by NSF Grant ESS-8307796 and Office of Naval Research Grant N00014-86-K-0689.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Wagner, D.K. Equivalent factor matroids of graphs. Combinatorica 8, 373–377 (1988). https://doi.org/10.1007/BF02189093

Download citation

AMS subject classification code (1980)

  • 05 B 35