A graph is 1-extendible if every edge has a 1-factor containing it. A 1-ext
endible non-bipartite graph G is said to be near bipartite if there exist e
dges e(1) and e(2) such that G - { e(1), e(2)} is 1-extendible and bipartit
e. We characterise the Pfaffian near bipartite graphs in terms of forbidden
subgraphs. The theorem extends an earlier character isa lion of Pfaffian b
ipartite graphs. (C) 2001 Academic Press.