This chapter examines graphic matroids in more detail. In particular, it presents several proofs delayed from Chapters 1 and 2, including proofs that a graphic matroid is representable over every field, and that a cographic matroid M*(G) is graphic only if G is planar. The main result of the chapter is Whitney's 2-Isomorphism Theorem, which establishes necessary and sufficient conditions for two graphs to have isomorphic cycle matroids.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.