A characterisation of Pfaffian near bipartite graphs
Combinatorics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0002062,
title = {A characterisation of Pfaffian near bipartite graphs},
author = {Ilse Fischer and C. H. C. Little},
journal= {arXiv preprint arXiv:math/0002062},
year = {2007}
}