An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
From MaRDI portal
Publication:1743482
DOI10.1007/s10878-017-0207-0zbMath1387.05198OpenAlexW2770701741MaRDI QIDQ1743482
Xing Feng, Mingzu Zhang, Lian Zhu Zhang
Publication date: 13 April 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0207-0
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Pfaffian graphs embedding on the torus
- The Pfaffian property of circulant graphs
- The complexity of computing the permanent
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Matching theory
- Matching structure and the matching lattice
- Pólya's permanent problem
- A characterization of convertible (0,1)-matrices
- Permanents, Pfaffian orientations, and even directed circuits
- The Pfaffian property of Cartesian products of graphs
- Pfaffian orientations for a type of bipartite graph
- The statistics of dimers on a lattice
- On the number of dissimilar pfaffian orientations of graphs
- Double vertex-edge domination
- Global total Roman domination in graphs
This page was built for publication: An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
