arXiv Analytics

Sign in

arXiv:math/9909026 [math.CO]AbstractReferencesReviewsResources

Towards a characterisation of Pfaffian graphs

Charles H. C. Little, Franz Rendl, Ilse Fischer

Published 1999-09-03, updated 1999-09-06Version 2

A bipartite graph G is known to be Pfaffian if and only if it does not contain an even subdivision H of $K_{3,3}$ such that $G - VH$ 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.

Comments: added references
Categories: math.CO
Subjects: 05C70
Related articles: Most relevant | Search more
arXiv:0708.1174 [math.CO] (Published 2007-08-08, updated 2011-09-06)
On some lower bounds on the number of bicliques needed to cover a bipartite graph
arXiv:1501.01707 [math.CO] (Published 2015-01-08)
Convex p-partitions of bipartite graphs
arXiv:1903.09725 [math.CO] (Published 2019-03-22)
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs