|
Organizers |
A Characterisation of Pfaffian Near Bipartite Graphs
by
Charles Little
Massey University
Coauthors: Ilse Fischer (University of Klagenfurt)
A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G - {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.
Date received: September 21, 2000
Copyright © 2000 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 # caek-19.