2015/10/26 by M. Abreu, Abreu, Marièn, D. Labbate +3
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1510.07553
openalex publication_date 2015/10/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \citeFL. Our graph theoretical characterization is equivalent to the one proved by Little in \citeL73 (cf. \citeLR) using linear algebra arguments.