Abstract
We prove that a graph is Pfaffian if and only if it can be drawn in the plane (possibly with crossings) so that every perfect matching intersects itself an even number of times.
Chapter PDF
Similar content being viewed by others
References
Galluccio, A., Loebl, M.: On the theory of Pfaffian orientations. I. Perfect matchings and permanents. Electron. J. combin. 6(1), 18 pp. (1999); Research Paper 6 (electronic)
Kasteleyn, P.W.: The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice. Physica 27, 1209–1225 (1961)
Kasteleyn, P.W.: Dimer statistics and phase transitions. J. Mathematical Phys. 4, 287–293 (1963)
Kasteleyn, P.W.: Graph Theory and Crystal Physics. In: Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)
Klee, V., Lardner, R., Manber, R.: Signsolvability revisited. Linear Algebra Appl. 59, 131–157 (1984)
Little, C.H.C.: A characterization of convertible (0,1)-matrices. J. Comb. Theory B 18, 187–208 (1975)
McCuaig, W.: Polya’s permanent problem (preprint)
Norine, S.: Pfaffian graphs, T-joins and crossing numbers (submitted)
Norine, S.: In Preparation
Pach, J., Toth, G.: Which crossing number is it anyway? J. Comb. Theory Ser. B 80(2), 225–246 (2000)
Pólya, G.: Augfabe 424. Arch. Math. Phys. Ser. 20, 271 (1913)
Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Ann. of Math. 150(2), 929–975 (1999)
Samuelson, P.: Foundations of Economic Analysis. Atheneum, New York (1971)
Tesler, G.: Matching in graphs on non-orientable surfaces. J. Comb. Theory B 78, 198–231 (2000)
Vazirani, V.V., Yannakakis, M.: Pfaffian orientations, 0 − 1 permanents, and even cycles in directed graphs. Discrete Appl. Math. 25, 179–190 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Norine, S. (2005). Drawing Pfaffian Graphs. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)