A new proof of a characterisation of Pfaffian bipartite graphs

doi:10.1016/j.jctb.2003.10.004

Journal of Combinatorial Theory, Series B

Volume 91, Issue 1, May 2004, Pages 123-126

https://doi.org/10.1016/j.jctb.2003.10.004 Get rights and content

Under an Elsevier user license

open archive

Abstract

In (J. Combin. Theory Ser. 18 (1975) 187) Little proved that a bipartite graph G is 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. This paper gives a significantly shorter proof of this theorem.

Keywords

Bipartite graphs

Pfaffian graphs

1-factors