Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

Characterizing 3-connected planar graphs and graphic matroids
by
Haidong Wu
University of Mississippi
Coauthors: Manoel Lemos, Talmage James Reid

A well-known result of Tutte says that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cunningham generalized Tutte's result by giving a characterization of graphic matroids using non-separating cocircuits. In this paper, we generalize both results and give new characterizations of 3-connected planar graphs and graphic matroids.

Date received: April 18, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-59.