Towards a characterisation of Pfaffian graphs
Combinatorics
2007-05-23 v2
Abstract
A bipartite graph G is known to be Pfaffian if and only if it does not contain an even subdivision H of such that contains a 1-factor. However a general characterisation of Pfaffian graphs in terms of forbidden subgraphs is currently not known. In this paper we describe a possible approach to the derivation of such a characterisation. We also extend the characterisation for bipartite graphs to a slightly more general class of graphs.
Cite
@article{arxiv.math/9909026,
title = {Towards a characterisation of Pfaffian graphs},
author = {Charles H. C. Little and Franz Rendl and Ilse Fischer},
journal= {arXiv preprint arXiv:math/9909026},
year = {2007}
}
Comments
added references