An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
type: Item
instance of: scholarly article
title: An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
zbMATH Open document ID: 1387.05198
author: Xing Feng
author: Mingzu Zhang
author: Lianzhu Zhang
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6859586
zbMATH Keywords: Pfaffian orientation
zbMATH Keywords: perfect matching
zbMATH Keywords: bipartite graph
MaRDI profile type: Publication
full work available at URL: s10878-017-0207-0
OpenAlex ID: W2770701741
cites work: Global total Roman domination in graphs
cites work: On the number of dissimilar pfaffian orientations of graphs
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Q5605168
cites work: Double vertex-edge domination
cites work: Pfaffian orientations for a type of bipartite graph
cites work: A characterization of convertible (0,1)-matrices
cites work: Matching structure and the matching lattice
cites work: Matching theory
cites work: The Pfaffian property of Cartesian products of graphs
cites work: The Pfaffian property of circulant graphs
cites work: Pólya's permanent problem
cites work: Permanents, Pfaffian orientations, and even directed circuits
cites work: The complexity of computing the permanent
cites work: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
cites work: Pfaffian graphs embedding on the torus
DOI: 10.1007/S10878-017-0207-0
description: scientific article; zbMATH DE number 6859586