Ilse Fischer, C. H. C. Little
Published 2000-02-09Version 1
In 1967 Kasteleyn introduced a powerful method for enumerating the 1-factors of planar graphs. In fact his method can be extended to graphs which permit an orientation under which every alternating circuit is clockwise odd. Graphs with this property are called {\it Pfaffian}. Little characterised Pfaffian bipartite graphs in terms of forbidden subgraphs in 1975. We extend his characterisation to near bipartite graphs.
Clique immersions in graphs with certain forbidden subgraphs
On choosability with separation of planar graphs with lists of different sizes
Monotone drawings of planar graphs
![QR code for arXiv:math/0002062 [math.CO]](http://oss.arxitics.com/images/favicon.svg)