Skip to main content
Conference ProceedingsOPEN ACCESS

Drawing Pfaffian graphs

Lecture Notes in Computer Science (2004) 3383 371-376
DOI: 10.1007/978-3-540-31843-9_37
5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Norine, S. (2004). Drawing Pfaffian graphs. In Lecture Notes in Computer Science (Vol. 3383, pp. 371–376). https://doi.org/10.1007/978-3-540-31843-9_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free