Towards a characterisation of Pfaffian near bipartite graphs

[1]  C. Little.  Kasteleyn's Theorem and Arbitrary Graphs , 1973, Canadian Journal of Mathematics.

[2]  C. Little.  A characterization of convertible (0, 1)-matrices , 1975 .

[3]  László Lovász,et al.  Brick decompositions and the matching rank of graphs , 1982, Comb..

[4]  László Lovász,et al.  Matching structure and the matching lattice , 1987, J. Comb. Theory, Ser. B.

[5]  F. Rendl,et al.  An algorithm for the ear decomposition of a 1-factor covered graph , 1989 .

[6]  F. Rendl,et al.  Operations preserving the pfaffian property of a graph , 1991, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[7]  Claudio L. Lucchesi,et al.  Ear Decompositions of Matching Covered Graphs , 1999, Comb..

[8]  Ilse Fischer,et al.  A Characterisation of Pfaffian Near Bipartite Graphs , 2001, J. Comb. Theory, Ser. B.